oj.uz

Submission #348958

# Submission time Handle Problem Language Result Execution time Memory
348958 2021-01-16T07:43:12 Z ali_tavakoli XOR Sum (info1cup17_xorsum) C++14
45 / 100
 1600 ms 4208 KB 
//In The Name Of Allah
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
#define pb push_back
#define F first
#define S second
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

const int maxn = 1e6 + 5, mxn = 1e6 + 5;

int n, a[maxn], cnt[maxn];

void sub1()
{
	int ans = 0;
	for(int i = 0; i < n; i++)
		for(int j = i; j < n; j++)
			ans ^= (a[i] + a[j]);
	cout << ans << '\n';
}

void sub2()
{
	int ans = 0;
	for(int i = 0; i < n; i++)
		cnt[a[i]] ++;
	for(int i = 0; i < mxn; i++)
		for(int j = i + 1; j < mxn; j++)
			if((cnt[i] * cnt[j]) & 1)
				ans ^= (i + j);
	//cout << ans << '\n';
	for(int i = 0; i < mxn; i++)
		if((cnt[i] * (cnt[i] - 1) / 2 + cnt[i]) & 1)
			ans ^= (i + i);
	cout << ans << '\n';
}

int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	//auto t = clock();
	cin >> n;
	for(int i = 0; i < n; i++)
		cin >> a[i];
	
	if(n <= (1e5))
		sub1();
	else
		sub2();
}

Subtask #1
7.0 / 7.0

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

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1689 ms 4208 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1689 ms 4208 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 547 ms 748 KB Output is correct
4 Correct 549 ms 876 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Execution timed out 1689 ms 4208 KB Time limit exceeded
4 Halted 0 ms 0 KB -