oj.uz

Submission #307140

# Submission time Handle Problem Language Result Execution time Memory
307140 2020-09-27T07:36:00 Z Hemimor XORanges (eJOI19_xoranges) C++14
100 / 100
 958 ms 11520 KB 
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <random>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

vi vin(int n,int d=0){
	vi a(n);
	for(auto &i:a){
		cin>>i;
		i-=d;
	}
	return a;
}

vl vln(int n,int d=0){
	vl a(n);
	for(auto &i:a){
		cin>>i;
		i-=d;
	}
	return a;
}

vvi gin(int n,int m,int d=1){
	vvi g(n);
	for(int i=0;i<m;i++){
		int u,v;
		cin>>u>>v;
		u-=d,v-=d;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	return g;
}

void vout(vi a){
	int n=a.size();
	cout<<n<<" :";
	for(auto i:a) cout<<' '<<i;
	cout<<endl;
}

class Segment_Tree{
	private:
	int n;
	vi date;
	public:
	void Init(int n_){
		n=1;
		while(n<n_) n*=2;
		date=vi(2*n-1);
	}
	void Update(int k,int x){
		k+=n-1;
		date[k]=x;
		while(k>0){
			k=(k-1)/2;
			date[k]=date[k*2+1]^date[k*2+2];
		}
	}
	int Query(int a,int b){
		a+=n-1;b+=n-1;
		int m=0;
		while(a<b){
			if(a%2==0) m^=date[a++];
			if(b%2==0) m^=date[--b];
			a/=2;b/=2;
		}
		return m;
	}
	int Open(int k){return date[k+n-1];}
};

int n,q;

int main(){
	cin>>n>>q;
	vi a=vin(n);
	Segment_Tree st[2];
	st[0].Init(n);
	st[1].Init(n);
	for(int i=0;i<n;i++) st[i%2].Update(i/2,a[i]);
	for(int i=0;i<q;i++){
		int t,l,r;
		cin>>t>>l>>r;
		if(t==1){
			l--;
			a[l]=r;
			st[l%2].Update(l/2,a[l]);
		}
		else{
			l--;
			if((r-l)%2==0) cout<<0<<endl;
			else cout<<st[l%2].Query(l/2,l/2+(r-l+1)/2)<<endl;
		}
	}
}

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 18 ms 640 KB Output is correct
12 Correct 18 ms 640 KB Output is correct
13 Correct 22 ms 640 KB Output is correct
14 Correct 22 ms 640 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 945 ms 11520 KB Output is correct
2 Correct 958 ms 11256 KB Output is correct
3 Correct 950 ms 11384 KB Output is correct
4 Correct 912 ms 11128 KB Output is correct
5 Correct 919 ms 11128 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 18 ms 640 KB Output is correct
12 Correct 18 ms 640 KB Output is correct
13 Correct 22 ms 640 KB Output is correct
14 Correct 22 ms 640 KB Output is correct
15 Correct 945 ms 11520 KB Output is correct
16 Correct 958 ms 11256 KB Output is correct
17 Correct 950 ms 11384 KB Output is correct
18 Correct 912 ms 11128 KB Output is correct
19 Correct 919 ms 11128 KB Output is correct
20 Correct 761 ms 11132 KB Output is correct
21 Correct 754 ms 11128 KB Output is correct
22 Correct 754 ms 11128 KB Output is correct
23 Correct 890 ms 11040 KB Output is correct
24 Correct 895 ms 11000 KB Output is correct