# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
767197 | ihceker | XORanges (eJOI19_xoranges) | C++14 | 424 ms | 11996 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define int long long
#define MOD 1000000007
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int arr[200005],s[2][800020];
void build(int node,int l,int r,int t){
if(l==r){
s[t][node]=arr[(t==0?l*2-1:l*2)];
return;
}
int mid=(l+r)/2;
build(node*2,l,mid,t);
build(node*2+1,mid+1,r,t);
s[t][node]=(s[t][node*2]^s[t][node*2+1]);
return;
}
void update(int node,int l,int r,int x,int y,int t){
if(l>x || r<x)return;
if(l==r){
s[t][node]=y;
return;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |