/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Wrong Answer 6ms 436.0 KiB
#3 Wrong Answer 6ms 596.0 KiB
#4 Wrong Answer 5ms 624.0 KiB
#5 Wrong Answer 5ms 608.0 KiB
#6 Accepted 4ms 580.0 KiB
#7 Accepted 5ms 572.0 KiB
#8 Wrong Answer 5ms 580.0 KiB
#9 Wrong Answer 5ms 532.0 KiB
#10 Wrong Answer 5ms 576.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MOD 1000000007
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define F first
#define S second
#define yes cout<<"YES"<<'\n';
#define no cout<<"NO"<<'\n';
#define endl "\n"
#define all(v) v.begin(),v.end()
#define print(v) for(auto it:v) cout<<it<<" "; cout<<endl;
#define srt(v) sort(v.begin(),v.end());
#define rsrt(v) sort(v.rbegin(),v.rend());
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define PI 2*acos(0.0)
#define pr pair<int,int>
#define Tasrik ios_base::sync_with_stdio(0);  cin.tie(0); cout.tie(0);

int main ()
{
    Tasrik;
    ll t=1,n=3;
    cin>>t;
    while(t--)
    {
        vl ar(n);
        set<ll>s;
        for(int i=0; i<n; i++)
        {
            cin>>ar[i];
            s.insert(ar[i]);
        }
        srt(ar);
        ll ans=0;
        for(int i=1; i<n; i++)
        {
           // if(ar[i]!=ar[i-1])
               // ans++;
               ans+=ar[i]-ar[i-1];
        }
      ans/=2;
       cout<<ans<<endl;
       //cout<<s.size()-1<<endl;
    }

}


Information

Submit By
Type
Submission
Problem
P1061 Bring equality
Contest
Brain Booster #4
Language
C++17 (G++ 13.2.0)
Submit At
2024-07-14 18:07:18
Judged At
2024-10-03 13:35:27
Judged By
Score
30
Total Time
6ms
Peak Memory
624.0 KiB