# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
339459 | Vladikus004 | XOR (IZhO12_xor) | C++14 | 299 ms | 51820 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 mp make_pair
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define inf 2e9
#define ff first
#define ss second
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
struct node{
int mx;
node *nxt[2];
node(){
mx = -1;
nxt[0]=nxt[1]=nullptr;
}
};
node *root = new node();
const int N = 250000 + 3;
int n, x, a[N];
void add(node *cur, int x, int h, int pos){
if (h == 0) {
cur->mx = max(cur->mx, pos);
return;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |