# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
230023 | AQT | Game (IOI13_game) | C++14 | 8714 ms | 67936 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>
using namespace std;
mt19937 rando (chrono::steady_clock::now().time_since_epoch().count());
struct snode {
pair<int, int> p;
long long x, g;
int pri;
snode * c[2];
snode (int pp1, int pp2, long long v){
p = {pp1, pp2};
x = g = v;
pri = uniform_int_distribution<int>(INT_MIN, INT_MAX) (rando);
c[0] = c[1] = NULL;
}
};
struct bnode {
snode * rt;
bnode * lft, * rht;
bnode(){
lft = rht = NULL;
rt = NULL;
}
};
bnode * rt;
Compilation message (stderr)
# | 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... |