oj.uz

답안 #1098107

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1098107 2024-10-09T04:41:21 Z omar1312 XORanges (eJOI19_xoranges) C++17
100 / 100
 94 ms 16212 KB 
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
const int mod = 1000000007;
const int N = 262144;
ll a[N+2];
ll tree[N*2+2][2];
ll query(int node, int L, int R, int l, int r, bool odd){
	if(l > R || r < L)return 0;
	if(l >= L && r <= R){
		return tree[node][odd];
	}
	ll mid = (l + r) / 2;
	return (query(node * 2, L, R, l, mid, odd) ^ query(node * 2 + 1, L, R, mid+1, r, odd));
}
void update(int ind, int node, int n){
	ll old = ind;
	old += n;
	tree[old][ind % 2] = node;
	a[ind] = node;
	old >>= 1;
	while(old){
		tree[old][ind % 2] = tree[old * 2][ind % 2] ^ tree[old * 2 + 1][ind % 2];
		old >>= 1;
	}
	return;
}
void solve(){
	int n, q;
	cin>>n>>q;
	for(int i = 0; i < n; i++){
		cin>>a[i];
	}
	ll off = 1;
	while(off < n)off <<= 1;
	n = off;
	for(int i = 0; i < n; i++){
		tree[i + n][i % 2] = a[i];
	}
	for(int i = n-1; i >= 0; i--){
		tree[i][0] = tree[i * 2][0] ^ tree[i * 2 + 1][0];
		tree[i][1] = tree[i * 2][1] ^ tree[i * 2 + 1][1];
	}
	while(q--){
		int type;
		cin>>type;
		if(type == 1){
			int u, x;
			cin>>u>>x;
			--u;
			update(u, x, n);
		}
		else{
			int l, r;
			cin>>l>>r;
			if((r - l + 1) % 2 == 0){
				cout<<0<<'\n';
				continue;
			}
			--l;
			--r;
			cout<<query(1, l, r, 0, n-1, l % 2)<<'\n';
		}
	}
}
int main(){
cin.tie(0)->sync_with_stdio(0);
	int tt = 1;
	// cin>>tt;
	while(tt--){
		solve();
		cout<<'\n';
	}
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 372 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 372 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 3 ms 860 KB Output is correct
13 Correct 2 ms 860 KB Output is correct
14 Correct 2 ms 860 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 94 ms 16132 KB Output is correct
2 Correct 84 ms 16208 KB Output is correct
3 Correct 91 ms 16212 KB Output is correct
4 Correct 81 ms 15700 KB Output is correct
5 Correct 81 ms 15824 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 372 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 3 ms 860 KB Output is correct
13 Correct 2 ms 860 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 94 ms 16132 KB Output is correct
16 Correct 84 ms 16208 KB Output is correct
17 Correct 91 ms 16212 KB Output is correct
18 Correct 81 ms 15700 KB Output is correct
19 Correct 81 ms 15824 KB Output is correct
20 Correct 77 ms 15952 KB Output is correct
21 Correct 83 ms 15800 KB Output is correct
22 Correct 82 ms 15868 KB Output is correct
23 Correct 77 ms 15696 KB Output is correct
24 Correct 85 ms 15704 KB Output is correct