oj.uz

Submission #389569

# Submission time Handle Problem Language Result Execution time Memory
389569 2021-04-14T07:34:09 Z rk42745417 XOR Sum (info1cup17_xorsum) C++17
11 / 100
 1600 ms 43600 KB 
#include <bits/stdc++.h>
using namespace std;

#define EMT ios::sync_with_stdio(0); cin.tie(0);
using ll = int64_t;
using ull = uint64_t;
using uint = uint32_t;
using ld = long double;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
const double EPS = 1e-9;

const int N = 1e5 + 25, LGN = 20;
struct trie {
	struct node {
		int l, r, cnt;
	} arr[N * LGN];
	int t = 2;
	inline int cnt(int p) { return p ? arr[p].cnt : 0; }
	int insert(int v, int n, int id, int c) {
		if(!id)
			id = t++;
		//cout << "inserting " << n << ' ' << id << '\n';
		if(n == -1) {
			arr[id].cnt += c;
			return id;
		}
		if(v >> n & 1)
			arr[id].r = insert(v, n - 1, arr[id].r, c);
		else
			arr[id].l = insert(v, n - 1, arr[id].l, c);
		arr[id].cnt = cnt(arr[id].l) + cnt(arr[id].r);
		return id;
	}
	int que(int v, int n, int tar, int id) {
		if(!id)
			return 0;
		//cout << "owo " << tar << ' ' << id << '\n';
		if(v >> tar & 1) {
			if(n == -1)
				return arr[id].cnt;
			if(v >> n & 1) {
				return que(v, n - 1, tar, arr[id].l);
			}
			else {
				return cnt(arr[id].l) + que(v | (1 << n), n - 1, tar, arr[id].r);
			}
		}
		else {
			if(n == -1)
				return 0;
			if(v >> n & 1) {
				return que(v, n - 1, tar, arr[id].l) + cnt(arr[id].r);
			}
			else {
				return que(v | (1 << n), n - 1, tar, arr[id].r);
			}
		}
	}
	inline int query(int v, int tar) {
		//cout << "here " << v << ' ' << tar << ' ' << arr[1].l << '\n';
		return que(v, tar - 1, tar, arr[1].l) + que(v ^ (1 << tar), tar - 1, tar, arr[1].r);
	}
} tri[LGN];

signed main() {
	int n;
	cin >> n;
	map<int, int> num;
	for(int i = 0, x; i < n; i++) {
		cin >> x;
		num[x]++;
	}
	int ans = 0;
	for(const auto &[v, cnt] : num) {
		if(cnt & 1) {
			///*
			for(int i = 0; i < LGN; i++) {
				int w = tri[i].query(v, i);
				//cout << v << ' ' << i << ' ' << w << '\n';
				if(w & 1)
					ans ^= 1 << i;
			}
			//*/
		}
		for(int i = 0; i < LGN; i++)
			tri[i].insert(v, i, 1, cnt);
		if(1LL * cnt * (cnt + 1) / 2 % 2)
			ans ^= v + v;
	}
	cout << ans << '\n';
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 2884 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 369 ms 1516 KB Output is correct
2 Correct 348 ms 1476 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 369 ms 1516 KB Output is correct
2 Correct 348 ms 1476 KB Output is correct
3 Execution timed out 1678 ms 43600 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 2884 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 2884 KB Output isn't correct
2 Halted 0 ms 0 KB -