# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
545993 | sliviu | Game (IOI13_game) | C++17 | 1 ms | 340 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;
using ll = long long;
static int R, C;
ll gcd2(ll x, ll y) {
if (y == 0) return x;
return gcd2(y, x % y);
}
struct nodex {
nodex* left = 0, * right = 0;
int l, r;
ll val;
nodex(int _l, int _r) :l(_l), r(_r) {}
};
struct nodey {
nodey() { val = new nodex(1, C); };
nodey* left = 0, * right = 0;
nodex* val = 0;
} *root;
void UpdateX(int pos, ll val, nodex* nod) {
int l = nod->l, r = nod->r, m = (l + r) / 2;
if (l == r) {
nod->val = val;
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... |