# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
364067 | Temmie | Game (IOI13_game) | C++17 | 2 ms | 876 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 ll;
ll gcd(ll x, ll y) {
ll z;
while (x != y && y != 0) z = x, x = y, y = z % y;
return x;
}
const int size = 1 << 30;
struct Row {
Row* l = nullptr, * r = nullptr;
ll d;
std::pair <int, int> span;
int mid;
Row (const std::pair <int, int>& SPAN) :
d(0),
span(SPAN),
mid((SPAN.first + SPAN.second) >> 1)
{ }
~Row() {
if (l) delete(l);
# | 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... |