oj.uz

Submission #362486

# Submission time Handle Problem Language Result Execution time Memory
362486 2021-02-03T11:07:42 Z keta_tsimakuridze XOR Sum (info1cup17_xorsum) C++14
56 / 100
 1600 ms 19180 KB 
#include<bits/stdc++.h>
#define f first
#define s second
using namespace std;
const int N=1e6+5;
int a[N],s[N],n,cnt,c[2],ans,cur,pos[N],f[2][N];
main(){
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>n;
	for(int k=1;k<=n;k++){
		cin>>a[k]; pos[k]=k;
		cnt+=c[(a[k]&1)^1];
		c[a[k]&1]++;
		s[k]=a[k]&1;
	}
	if(cnt%2) ans=1;
	int i=0;
		c[1]=c[0]=0;
	for(int k=1;k<=n;k++){
		int b = ((1<<i)&a[pos[k]]);
		b=min(b,1);
		c[b]++;
		f[b][c[b]]=pos[k];
	}
	cur=0;
	for(int j=0;j<=1;j++){
		for(int k=1;k<=c[j];k++){
			cur++;
			pos[cur]=f[j][k];
		}
	}
	
	for(int i=1;i<=30;i++){
	c[1]=c[0]=0;
	for(int k=1;k<=n;k++){
		int b = ((1<<i)&a[pos[k]]);
		b=min(b,1);
		c[b]++;
		f[b][c[b]]=pos[k];
	}
	cur=0;
	for(int j=0;j<=1;j++){
		for(int k=1;k<=c[j];k++){
			cur++;
			pos[cur]=f[j][k];
		}
	}
		for(int k=1;k<=n;k++)
		s[k]+=a[k]&(1ll<<i);
		cnt=0;
		int l=n,r=n,l1=n,r1=n;
		for(int k=1;k<=n;k++){
		         while(r && s[pos[r]] + s[pos[k]] >= (1<<(i+1)) ) r--;
		         while(l && s[pos[l]] + s[pos[k]] >= (1<<i) ) l--;
		         cnt += r-l; cnt %=4;  
		         while( l1&&s[pos[l1]] + s[pos[k]] >=((1<<(i+1))+(1<<i)) ) l1--;
		         cnt+=n-l1; cnt%=4;
		}
		
		int c1=0;
		for(int k=1;k<=n;k++){
		           if((2*a[k])&(1<<i)) c1++;
		}
        c1%=4;
		if((c1+(cnt-c1+4)/2)%2==1) ans+=1<<i;
		
	}
	cout<<ans;
}

Compilation message

xorsum.cpp:7:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    7 | main(){
      |      ^
xorsum.cpp: In function 'int main()':
xorsum.cpp:51:20: warning: unused variable 'r1' [-Wunused-variable]
   51 |   int l=n,r=n,l1=n,r1=n;
      |                    ^~

Subtask #1
7.0 / 7.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1504 ms 19180 KB Output is correct
2 Correct 1367 ms 17672 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1504 ms 19180 KB Output is correct
2 Correct 1367 ms 17672 KB Output is correct
3 Execution timed out 1694 ms 18940 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 492 KB Output is correct
2 Correct 6 ms 492 KB Output is correct
3 Correct 126 ms 2284 KB Output is correct
4 Correct 124 ms 2284 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 492 KB Output is correct
2 Correct 6 ms 492 KB Output is correct
3 Correct 1504 ms 19180 KB Output is correct
4 Correct 1367 ms 17672 KB Output is correct
5 Execution timed out 1694 ms 18940 KB Time limit exceeded
6 Halted 0 ms 0 KB -