oj.uz

Submission #872637

# Submission time Handle Problem Language Result Execution time Memory
872637 2023-11-13T13:21:51 Z racsosabe XOR Sum (info1cup17_xorsum) C++14
100 / 100
 885 ms 84716 KB 
#include<bits/stdc++.h>
using namespace::std;

const int N = 1000000 + 5;
const int L = 31;

int n;
long long a[N];

vector<pair<long long, int>> parse(vector<long long> &v) {
	int l = 0;
	vector<pair<long long, int>> res;
	while(l < v.size()) {
		int r = l;
		while(r < v.size() and v[l] == v[r]) r += 1;
		res.emplace_back(v[l], r - l);
		l = r;
	}
	return res;
}

long long get_crossed(vector<pair<long long, int>> a, vector<pair<long long, int>> b, long long m) {
	int sum_a = 0, sum_b = 0;
	for(auto x : a) sum_a += x.second;
	for(auto x : b) sum_b += x.second;
	long long res = 1ll * sum_a * sum_b;
	int at = b.size() - 1;
	int sum = 0;
	for(auto x : a) {
		if(x.first == 0) continue;
		long long want = m - x.first;
		while(at >= 0 and b[at].first >= want) {
			sum += b[at].second;
			at -= 1;
		}
		res -= 1ll * x.second * sum;
	}
	return res;
}

long long get_pairs(vector<pair<long long, int>> &v, long long m) {
	vector<int> suffix_sum;
	for(int i = 0; i < v.size(); i++) suffix_sum.emplace_back(v[i].second);
	suffix_sum.emplace_back(0);
	for(int i = (int)suffix_sum.size() - 2; i >= 0; i--) suffix_sum[i] += suffix_sum[i + 1];
	long long res = 0;
	int at = (int)v.size() - 1;
	for(int i = 0; i < v.size(); i++) {
		long long want = m - v[i].first;
		while(at >= 0 and v[at].first >= want) at -= 1;
		int to = max(at, i) + 1;
		res += 1ll * v[i].second * suffix_sum[to];
		if((v[i].first << 1) >= m) res += 1ll * v[i].second * (v[i].second - 1) / 2;
	}
	return res;
}

long long get_bits(int b, long long p) {
	vector<long long> ones;
	vector<long long> zeros;
	vector<long long> ones_values;
	vector<long long> zeros_values;
	for(int i = 0; i < n; i++) {
		if(a[i] & p) {
			ones.emplace_back(a[i] % p);
			ones_values.emplace_back(a[i]);
		}
		else {
			zeros.emplace_back(a[i] % p);
			zeros_values.emplace_back(a[i]);
		}
	}
	vector<pair<long long, int>> p_ones = parse(ones), p_zeros = parse(zeros);
	long long res = get_crossed(p_ones, p_zeros, p);
	if(not ones.empty()) res += get_pairs(p_ones, p);
	if(not zeros.empty()) res += get_pairs(p_zeros, p);
	for(int i = 0; i < zeros_values.size(); i++) a[i] = zeros_values[i];
	for(int i = 0; i < ones_values.size(); i++) a[i + zeros_values.size()] = ones_values[i];
	return res;
}

int main(){
	scanf("%d", &n);
	long long X = 0, A = LLONG_MAX, O = 0;
	for(int i = 0; i < n; i++) {
		scanf("%lld", a + i);
		X ^= a[i] << 1;
		A &= a[i] << 1;
		O |= a[i] << 1;
	}
	long long p = 1;
	for(int b = 0; b < L; b++, p <<= 1) {
		long long cnt = get_bits(b, p);
		if(cnt & 1) X ^= p;
		if(cnt != 1ll * n * (n - 1) / 2) A &= ~p;
		if(cnt) O |= p;
	}
	printf("%lld\n", X);
	return 0;
}

Compilation message

xorsum.cpp: In function 'std::vector<std::pair<long long int, int> > parse(std::vector<long long int>&)':
xorsum.cpp:13:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |  while(l < v.size()) {
      |        ~~^~~~~~~~~~
xorsum.cpp:15:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |   while(r < v.size() and v[l] == v[r]) r += 1;
      |         ~~^~~~~~~~~~
xorsum.cpp: In function 'long long int get_pairs(std::vector<std::pair<long long int, int> >&, long long int)':
xorsum.cpp:43:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |  for(int i = 0; i < v.size(); i++) suffix_sum.emplace_back(v[i].second);
      |                 ~~^~~~~~~~~~
xorsum.cpp:48:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |  for(int i = 0; i < v.size(); i++) {
      |                 ~~^~~~~~~~~~
xorsum.cpp: In function 'long long int get_bits(int, long long int)':
xorsum.cpp:77:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |  for(int i = 0; i < zeros_values.size(); i++) a[i] = zeros_values[i];
      |                 ~~^~~~~~~~~~~~~~~~~~~~~
xorsum.cpp:78:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |  for(int i = 0; i < ones_values.size(); i++) a[i + zeros_values.size()] = ones_values[i];
      |                 ~~^~~~~~~~~~~~~~~~~~~~
xorsum.cpp: In function 'int main()':
xorsum.cpp:83:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
xorsum.cpp:86:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |   scanf("%lld", a + i);
      |   ~~~~~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 744 KB Output is correct
2 Correct 4 ms 736 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 465 ms 38448 KB Output is correct
2 Correct 429 ms 34052 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 465 ms 38448 KB Output is correct
2 Correct 429 ms 34052 KB Output is correct
3 Correct 697 ms 52892 KB Output is correct
4 Correct 671 ms 52004 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 744 KB Output is correct
2 Correct 4 ms 736 KB Output is correct
3 Correct 93 ms 9740 KB Output is correct
4 Correct 94 ms 9672 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 744 KB Output is correct
2 Correct 4 ms 736 KB Output is correct
3 Correct 465 ms 38448 KB Output is correct
4 Correct 429 ms 34052 KB Output is correct
5 Correct 697 ms 52892 KB Output is correct
6 Correct 671 ms 52004 KB Output is correct
7 Correct 93 ms 9740 KB Output is correct
8 Correct 94 ms 9672 KB Output is correct
9 Correct 727 ms 84716 KB Output is correct
10 Correct 885 ms 78488 KB Output is correct
11 Correct 823 ms 77820 KB Output is correct