제출 #601086

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
601086	2022-07-21 11:00:17	Fidan	XORanges (eJOI19_xoranges)	C++17	100 / 100	638 ms	22100 KiB

xoranges

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=(2e5)+10;
vector<ll> T1(4*N, 0);
vector<ll> T2(4*N, 0);
void upd(ll l, ll r, ll id, ll val, ll v, vector<ll> &T){
  if(l==id && r==l){
    T[v]=val;
    return;
  }
  ll mid=(l+r)/2;
  if(id<=mid) upd(l, mid, id, val, 2*v, T);
  else upd(mid+1, r, id, val, 2*v+1, T);
  T[v]=(T[2*v]^T[2*v+1]);
}
ll que(ll l, ll r, ll tl, ll tr, ll v, vector<ll> &T){
  if(l>r) return 0;
  if(l==tl && r==tr) return T[v];
  ll tm=(tl+tr)/2;
  return (que(l, min(tm, r), tl, tm, 2*v, T)^que(max(tm+1, l), r, tm+1, tr, 2*v+1, T));
}
int main(){
  ll n, q, i;
  cin>>n>>q;
  vector<ll> a(n+1, 0);
  vector<ll> b(n+1, 0);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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