oj.uz

Submission #354078

# Submission time Handle Problem Language Result Execution time Memory
354078 2021-01-21T12:16:50 Z YJU XORanges (eJOI19_xoranges) C++14
100 / 100
 128 ms 11180 KB 
#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.0 / 12.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 3 ms 748 KB Output is correct
12 Correct 3 ms 748 KB Output is correct
13 Correct 3 ms 748 KB Output is correct
14 Correct 3 ms 748 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 11116 KB Output is correct
2 Correct 107 ms 11180 KB Output is correct
3 Correct 108 ms 11116 KB Output is correct
4 Correct 95 ms 10860 KB Output is correct
5 Correct 96 ms 10860 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 3 ms 748 KB Output is correct
12 Correct 3 ms 748 KB Output is correct
13 Correct 3 ms 748 KB Output is correct
14 Correct 3 ms 748 KB Output is correct
15 Correct 112 ms 11116 KB Output is correct
16 Correct 107 ms 11180 KB Output is correct
17 Correct 108 ms 11116 KB Output is correct
18 Correct 95 ms 10860 KB Output is correct
19 Correct 96 ms 10860 KB Output is correct
20 Correct 128 ms 10860 KB Output is correct
21 Correct 112 ms 10988 KB Output is correct
22 Correct 113 ms 10860 KB Output is correct
23 Correct 100 ms 10860 KB Output is correct
24 Correct 102 ms 10860 KB Output is correct