Submission #265395

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
265395	2020-08-14 17:59:35	eagle30	XORanges (eJOI19_xoranges)	C++14	100 / 100	960 ms	8936 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;
int arr[1000000], binary1[1000000], binary2[1000000];
int n, m;
void update1(int s, int k){
    for(int i=s; i<=n; i+=i&-i)
        binary1[i]=(binary1[i]^k);
}
int query1(int s){
    int ans=0;
    for(int i=s; i>=1; i-=i&-i)
        ans=(ans^binary1[i]);
    return ans;
}
void update2(int s, int k){
    for(int i=s; i<=n; i+=i&-i)
        binary2[i]=(binary2[i]^k);
}
int query2(int s){
    int ans=0;
    for(int i=s; i>=1; i-=i&-i)
        ans=(ans^binary2[i]);
    return ans;
}
int main(){
cin>>n>>m;
for(int i=1; i<=n; i++){
    cin>>arr[i];
    if(i%2==1)
        update1(i, arr[i]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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