제출 #600982

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
600982		Fidan	XORanges (eJOI19_xoranges)	C++17	38 / 100	499 ms	12572 KiB

xoranges

#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);
	vector<ll> b(n+1);
	vector<ll> T1(n+1, 0);
	vector<ll> T2(n+1, 0);
	
	for(i=1; i<=n; i++){
		ll x;
		cin>>x;
		if(i%2==0){
			a[i]=x;
			b[i]=0;
			T1[i]=(T1[i-1]^a[i]);
		}
		else{
			b[i]=x;
			a[i]=0;
		}
		T1[i]=(T1[i-1]^a[i]);
		T2[i]=(T2[i-1]^b[i]);
	}
	
	while(q--){
		int t;
		cin>>t;
		if(t==1){
			ll j, asdf;
			cin>>j>>asdf;
		}
		else{
			ll l, r;
			cin>>l>>r;
			if((r-l)%2==1) cout<<0<<endl;
			else{
				if(l%2==0){
					cout<<(T1[r]^T1[l-1])<<endl;
				}
				else{
					cout<<(T2[r]^T2[l-1])<<endl;
				}
			}
		}
	}
	return 0;
}

• Subtask 1: 0 / 12
• Subtask 2: 18 / 18
• Subtask 3: 0 / 25
• Subtask 4: 20 / 20
• Subtask 5: 0 / 25