제출 #787144

#제출 시각아이디문제언어결과실행 시간메모리
787144ThylOneXORanges (eJOI19_xoranges)C++14
30 / 100
1070 ms1748 KiB
#include<bits/stdc++.h>

using namespace std;
#define int long long
signed main(){
	int n;cin>>n;
	int q;cin>>q;
	vector<int> nums(n);
	for(int i = 0 ; i < n ; i++){
		cin>>nums[i];
	}
	for(int _=0;_<q;_++){
		int type;cin>>type;
		if(type==1){
			int pos;cin>>pos;pos--;
			int val;cin>>val;
			nums[pos]=val;
		}else{
			int l,r;cin>>l>>r;
			l--;r--;
			int ans=0;
			
			for(int i = l;i<=r;i++){
				int act=0;
				for(int j=i;j<=r;j++){
					act^=nums[j];
					
					ans^=act;
				}
			}
			cout<<ans<<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...