oj.uz

Submission #649493

# Submission time Handle Problem Language Result Execution time Memory
649493 2022-10-10T09:57:00 Z berr XOR Sum (info1cup17_xorsum) C++17
7 / 100
 879 ms 5232 KB 
#include <bits/stdc++.h>
using namespace std;


int main()
{
	ios_base::sync_with_stdio(false);

	cin.tie(0);



	int n; cin>>n;

	if(n<5e3)
	{
		int ans=0;

		vector<int> a(n);

		for(int i=0; i<n; i++) cin>>a[i];
		for(int i=0; i<n; i++)
		{
			for(int l=i; l<n; l++)
			{
				ans^=(a[i]+a[l]);

			}
			
		}

		cout<<ans;
	}
	else
	{
		int ans=0;
		map<int, int> a;

		for(int i=0; i<n; i++){ int x; cin>>x; a[x]++;}

		for(int i=0; i<5e3; i++)
		{
			for(int l=i; l<5e3; l++)
			{
				if(a.count(l)>0&&a.count(i)>0)
				{
					if(l==i)
					{
						if((a[l]*(a[l]-1))%2==1) ans^=(l+i);
					}
					
				}
				else
				{
					if((a[l]*a[i])%2) ans^=(l+i);
				}
			}
		}

		cout<<ans;
	}
}

Subtask #1
7.0 / 7.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 212 KB Output is correct
2 Correct 5 ms 340 KB Output is correct
3 Incorrect 739 ms 5232 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 212 KB Output is correct
2 Correct 5 ms 340 KB Output is correct
3 Incorrect 879 ms 616 KB Output isn't correct
4 Halted 0 ms 0 KB -