# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
999780 | vjudge1 | XORanges (eJOI19_xoranges) | C++17 | 95 ms | 15188 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>
using namespace std;
#define endl '\n'
#define ll long long
#define pll pair<ll, ll>
const int sz = 2e5+5;
ll a[sz], b[sz], t[sz*4], t1[sz*4];
void build(ll v, ll l, ll r)
{
if (l == r){
t[v] = a[l];
t1[v] = b[l];
return;
}
ll m = (l + r)/2;
build(v*2, l, m);
build(v*2+1, m+1, r);
t[v] = t[v*2] ^ t[v*2+1];
t1[v] = t1[v*2] ^ t1[v*2+1];
}
void update(ll v, ll l, ll r, ll ind, ll val)
{
if (l == r){
t[v] = val;
return;
}
ll m = (l + r)/2;
# | 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... |