# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
382504 | Lord_Zebellak | XORanges (eJOI19_xoranges) | C++14 | 688 ms | 16492 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;
typedef long long int ll;
typedef vector <ll> vi;
typedef pair<ll,ll> pll;
#define mp make_pair
#define pb push_back
#define N ((ll)(2e5 + 5))
#define INF ((ll)1e18+18)
#define bismillah {ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
ll n,m;
ll st[4*N];
ll st2[4*N];
ll v[N];
void build1(ll l , ll r , ll i){
if (l==r ){
st[i] = v[l];
return;
}
ll tm = (l + r) >> 1;
build1(l, tm, 2*i);
build1(tm+1, r, 2*i+1);
st[i] = st[2*i] ^ st[2*i+1];
}
void build2(ll l , ll r , ll i){
if (l==r ){
# | 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... |