# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
898662 | typ_ik | XOR (IZhO12_xor) | C++17 | 1 ms | 348 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 ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define watch(x) cout << (#x) << " : " << x << '\n'
#define boost ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 3e5 + 128;
const int LOG = 31;
int n, x;
int a[N];
struct node {
node* nxt[2];
int min_id;
node* p;
node() {
nxt[0] = nxt[1] = p = nullptr;
min_id = N;
}
void upd() {
if (nxt[0] != nullptr)
min_id = min(min_id, nxt[0]->min_id);
if (nxt[1] != nullptr)
min_id = min(min_id, nxt[1]->min_id);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |