Submission #600995

#TimeUsernameProblemLanguageResultExecution timeMemory
600995FidanXORanges (eJOI19_xoranges)C++17
55 / 100
1078 ms2500 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
	ll n, q, i;
	cin>>n>>q;
	vector<ll> a(n+1);
	
	for(i=1; i<=n; i++){
		cin>>a[i];
	}
	
	while(q--){
		int t;
		cin>>t;
		if(t==1){
			ll j, asdf;
			cin>>j>>asdf;
			a[j]=asdf;
		}
		else{
			ll l, r;
			cin>>l>>r;
			if((r-l)%2==1) cout<<0<<endl;
			else{
				ll c=0;
				for(i=l; i<=r; i+=2){
					c=(c^a[i]);
				}
				cout<<c<<endl;
			}
		}
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...