Submission #992032

#TimeUsernameProblemLanguageResultExecution timeMemory
992032ramalzaherXOR Sum (info1cup17_xorsum)C++14
11 / 100
1625 ms131072 KiB
#include <bits/stdc++.h> #define ll long long #define sz size() #define pb push_back #define all(x) x.begin() , x.end() using namespace std; int main() { ll n; cin >> n ; ll a[n] ; map<int,int> mp ;ll mx = -1 ; for (int i = 0; i < n; i++) { cin >> a[i]; mp[a[i]] ++ ; mx = max(mx , a[i] ); } ll ans = 0 ; map<pair<int,int> , int > mp1 ; for(int i = 0 ; i < mx+22 ; i ++ ){ if(mp[i]==0)continue ; if((mp[i]*(mp[i]+1)/2)%2) { ans^=(i*2); } for(int j=i+1;j<=mx+22;++j) { if(mp[i]&&mp[j]&&(mp[i]*mp[j]%2==1)) { ans^=(i+j); } }} cout<<ans<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...