oj.uz

Submission #274724

# Submission time Handle Problem Language Result Execution time Memory
274724 2020-08-19T14:44:45 Z keta_tsimakuridze XORanges (eJOI19_xoranges) C++14
55 / 100
 1000 ms 11324 KB 
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int n,q,k,a[N],ind,x,l,r,tree[2][4*N];
void update(int u,int ind,int l,int r,int val,int p) {
	
	if(l>ind || r<ind) return;
	if(ind<=l && r<=ind) {
		tree[p][u]^=val;
		return;
	}
	int mid=(l+r)/2;
	update(2*u,ind,l,mid,val,p);
	update(2*u+1,ind,mid+1,r,val,p);
	tree[p][u]=tree[p][2*u]^tree[p][2*u+1];
}
int getans(int u,int start,int end,int l,int r,int p) {
	
	if(l>end || r<start) return 0;
	if(start<=l && r<=end) {
		return tree[p][u];
	}
	int mid=(l+r)/2;
	return getans(2*u,start,end,l,mid,p)^
	       getans(2*u+1,start,end,mid+1,r,p);
	//tree[u]=tree[2*u]^tree[2*u+1];
}

int main() {
	cin>>n>>q;
	for(k=1; k<=n; k++) {
		cin>>a[k];
		if(k%2==1) update(1,k,1,n,a[k],1);
		else update(1,k,1,n,a[k],0);
	
	}
	for(k=1; k<=q; k++) {
		cin>>x;
		if(x==1) {
			cin>>ind>>x; 
			if(ind%2==0) update(1,ind,1,n,a[ind]^x,0);
			else update(1,ind,1,n,a[ind]^x,1);
			a[ind]=x;	//cout<<getans(1,1,n,1,n,1)<<"+"<<endl;
		} else {
			cin>>l>>r;
			if((r-l+1)%2==0) cout<<0<<endl;
			else {

				cout<<getans(1,l,r,1,n,r%2)<<endl;
			}
		}
	}
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 20 ms 640 KB Output is correct
12 Correct 20 ms 640 KB Output is correct
13 Correct 29 ms 640 KB Output is correct
14 Correct 23 ms 640 KB Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 20 ms 640 KB Output is correct
12 Correct 20 ms 640 KB Output is correct
13 Correct 29 ms 640 KB Output is correct
14 Correct 23 ms 640 KB Output is correct
15 Execution timed out 1051 ms 11324 KB Time limit exceeded
16 Halted 0 ms 0 KB -