//♥God will make a way♥
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////de/////////////////////
int a[1000006];
int main() {
fastio;
int n; cin >> n; fra(n)
vpi v;
fri(n) v.pb({0, i});
ll ans = 0;
frj(30) {
ll cur = 0, pow = 1<<j;
if(j) { //sort
vpi newv;
fri(n) {
if(!(a[v[i].ss] & (1 << (j-1))))
newv.pb({a[v[i].ss] % (1<<j), v[i].ss});
}
fri(n) {
if(a[v[i].ss] & (1 << (j-1)))
newv.pb({a[v[i].ss] % (1<<j), v[i].ss});
}
v = newv;
}
vi pref1;
ll p = 0;
pref1.pb(0);
fri(n) {
if(a[v[i].ss] & pow) p++;
pref1.pb(p);
}
// print(v); print(pref1);
int id = n;
fri(n) {
while(id > 0 && pow - v[i].ff <= v[id-1].ff) //gtnel 1in >= y
id--;
// dbg(id)
if(a[v[i].ss] & pow) {
if(id)
cur += id - pref1[id]; //tars nshan unecoxneri mej man gal poqreri tivy
}
else cur += pref1[id]; //tars nshan unecoxneri mej man gal poqreri tivy
if(a[v[i].ss] & pow)
cur += pref1[n] - pref1[id];
else
cur += n-id - (pref1[n] - pref1[id]);
if(v[i].ff >= pow - v[i].ff)
cur--;
}
cur /= 2;
fri(n) if((a[i] + a[i]) & pow) cur++;
if(cur & 1) ans += pow;
}
cout << ans;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
340 KB |
Output is correct |
| 2 |
Correct |
4 ms |
468 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
889 ms |
28244 KB |
Output is correct |
| 2 |
Correct |
824 ms |
31120 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
889 ms |
28244 KB |
Output is correct |
| 2 |
Correct |
824 ms |
31120 KB |
Output is correct |
| 3 |
Correct |
1026 ms |
34908 KB |
Output is correct |
| 4 |
Correct |
978 ms |
33928 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
340 KB |
Output is correct |
| 2 |
Correct |
4 ms |
468 KB |
Output is correct |
| 3 |
Correct |
111 ms |
4404 KB |
Output is correct |
| 4 |
Correct |
106 ms |
4264 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
340 KB |
Output is correct |
| 2 |
Correct |
4 ms |
468 KB |
Output is correct |
| 3 |
Correct |
889 ms |
28244 KB |
Output is correct |
| 4 |
Correct |
824 ms |
31120 KB |
Output is correct |
| 5 |
Correct |
1026 ms |
34908 KB |
Output is correct |
| 6 |
Correct |
978 ms |
33928 KB |
Output is correct |
| 7 |
Correct |
111 ms |
4404 KB |
Output is correct |
| 8 |
Correct |
106 ms |
4264 KB |
Output is correct |
| 9 |
Correct |
1214 ms |
37580 KB |
Output is correct |
| 10 |
Correct |
1199 ms |
37496 KB |
Output is correct |
| 11 |
Correct |
1196 ms |
37452 KB |
Output is correct |
