Submission #354078

#	Time	Username	Problem	Language	Result	Execution time	Memory
354078		YJU	XORanges (eJOI19_xoranges)	C++14	100 / 100	128 ms	11180 KiB

xoranges

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=5e5+5;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

ll n,q,ty,x,y,u[N],bit[2][N];

void upd(ll B,ll id,ll val){
	for(int i=id;i<N;i+=(i&-i))bit[B][i]^=val;
}

ll ask(ll B,ll id){
	ll tmp=0;
	for(int i=id;i>0;i-=(i&-i))tmp^=bit[B][i];
	return tmp;
}

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>q;
	REP1(i,n)cin>>u[i],upd(i&1,i,u[i]);
	while(q--){
		cin>>ty>>x>>y;
		if(ty==1){
			upd(x&1,x,u[x]);
			upd(x&1,x,u[x]=y);
		}else{
			if((y-x+1)&1){
				cout<<(ask(y&1,y)^ask(y&1,x-1))<<"\n";
			}else{
				cout<<"0\n";
			}
		}
	}
	return 0;
}

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