oj.uz

Submission #272195

# Submission time Handle Problem Language Result Execution time Memory
272195 2020-08-18T10:30:08 Z theStaticMind XOR Sum (info1cup17_xorsum) C++14
77 / 100
 1600 ms 91068 KB 
#include<bits/stdc++.h>
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;

int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int n, ans = 0;
	cin >> n;
	vector<int> arr(n);
	vector<ii> A;

	for(int i = 0; i < n; i++) cin >> arr[i], A.pb({0, i});

	for(int d = 0; d < 32; d++){
		int w = (1ll << d);
		vector<ii> t0, t1;
		for(auto p : A){
			if(arr[p.second] & w) t1.pb({arr[p.second] % (w * 2), p.second});
			else t0.pb({arr[p.second] % (w * 2), p.second});
		}

		swap(A, t0);
		for(auto p : t1) A.pb(p);

		int p1 = n - 1, p2 = n - 1, p3 = n - 1, cnt = 0;

		for(auto p : A){
			while(p1 >= 0 && A[p1].first + p.first >= w) p1--;
			while(p2 >= 0 && A[p2].first + p.first >= w * 2) p2--;
			while(p3 >= 0 && A[p3].first + p.first >= w * 3) p3--;

			cnt += n - 1 - p3 + p2 - p1;
		}

		for(auto p : A){
			if((p.first * 2) & w) cnt++;
		}

		assert(cnt % 2 == 0);
		cnt /= 2;
		if(cnt % 2) ans |= w;
	}
	cout << ans;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1390 ms 76004 KB Output is correct
2 Correct 1292 ms 81260 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1390 ms 76004 KB Output is correct
2 Correct 1292 ms 81260 KB Output is correct
3 Correct 1515 ms 91068 KB Output is correct
4 Correct 1471 ms 82160 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 143 ms 10532 KB Output is correct
4 Correct 131 ms 10252 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 1390 ms 76004 KB Output is correct
4 Correct 1292 ms 81260 KB Output is correct
5 Correct 1515 ms 91068 KB Output is correct
6 Correct 1471 ms 82160 KB Output is correct
7 Correct 143 ms 10532 KB Output is correct
8 Correct 131 ms 10252 KB Output is correct
9 Execution timed out 1685 ms 85500 KB Time limit exceeded
10 Halted 0 ms 0 KB -