# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
437322 | denverjin | Game (IOI13_game) | C++14 | 3996 ms | 56884 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 "game.h"
#include <bits/stdc++.h>
typedef long long i64;
i64 gcd(i64 X, i64 Y) {
i64 tmp;
while (X != Y && Y != 0) {
tmp = X;
X = Y;
Y = tmp % Y;
}
return X;
}
struct Node {
int x, lx, rx;
i64 v, s;
int sz;
int ls, rs;
} t[22000 * 35];
const int null = 0;
int ndsz;
int new_node(int x, i64 v) {
int i = ++ ndsz;
t[i].x = t[i].lx = t[i].rx = x;
t[i].v = t[i].s = v;
t[i].sz = 1;
# | 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... |