# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
634360 | smartmonky | XORanges (eJOI19_xoranges) | C++14 | 523 ms | 15820 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 <iostream>
#include <algorithm>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define int ll
using namespace std;
const int N=3e5;
ll t[2][N*4],a[N],n;
void build(int v=1,int tl=1,int tr=n){
if(tl==tr){
// cout << (tl&1) <<" " <<v <<" "<< a[tl]<<endl;
t[(tl & 1)][v]=a[tl];
}else{
int mid=(tl+tr) >> 1;
build(v*2,tl,mid);
build(v*2+1,mid+1,tr);
t[1][v]=(t[1][v*2]^t[1][v*2+1]);
t[0][v]=(t[0][v*2]^t[0][v*2+1]);
}
}
void upd(int pos,int val,int v=1, int tl=1,int tr=n){
if(tl==tr){
Compilation message (stderr)
# | 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... |