# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
157048 | topology | Game (IOI13_game) | C++17 | 5836 ms | 87844 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>
#ifdef TOPOLOGY
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#include "game.h"
#define debug(...)
#endif
using namespace std;
int rr, cc;
long long gcd2(long long X, long long Y);
struct node {
long long g;
int q, v;
node *l, *r;
node(int q_, int v_) : g(), q(q_), v(v_), l(), r() {
// debug("%d %d\n", q_, v_);
}
long long upd(int q, long long k) {
if (q < this->q || this->v < q) return this->g;
if (this->q == this->v) {
return this->g = k;
}
int m = (this->q + this->v) >> 1;
node *&nd = q <= m ? this->l : this->r;
if (!nd) nd = new node(q, q);
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... |