제출 #962492

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
962492		penguin133	XORanges (eJOI19_xoranges)	C++17	100 / 100	231 ms	58760 KiB

xoranges

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

struct node{
	int s, e, m, val;
	node *l, *r;
	node(int _s, int _e){
		s = _s, e = _e, m = (s + e) >> 1;
		if(s != e)l = new node(s, m), r = new node(m+1, e);
		val = 0;
	}
	void upd(int p, int v){
		if(s == e)val = v;
		else{
			if(p <= m)l->upd(p, v);
			else r->upd(p, v);
			val = l->val ^ r->val;
		}
	}
	int qry(int a, int b){
		if(a == s && b == e)return val;
		if(b <= m)return l->qry(a ,b);
		if(a > m)return r->qry(a ,b);
		return l->qry(a, m) ^ r->qry(m+1, b);
	}
}*odd, *even;

int n, q, A[500005];

void solve(){
	cin >> n >> q;
	for(int i = 1; i <= n; i++)cin >> A[i];
	odd = new node(1, n);
	even = new node(1, n);
	for(int i = 1; i <= n; i++){
		if(i % 2)odd->upd(i, A[i]);
		else even->upd(i, A[i]);
	}
	while(q--){
		int a, b, c; cin >> a >> b >> c;
		if(a == 1){
			if(b%2)odd->upd(b, c);
			else even->upd(b, c);
		}
		else{
			if(c%2 != b%2)cout << 0 << '\n';
			else cout << (b%2 ? odd->qry(b, c) : even->qry(b, c)) << '\n';
		}
	}
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

컴파일 시 표준 에러 (stderr) 메시지

xoranges.cpp:62:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   62 | main(){
      | ^~~~

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