# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1077897 | TheQuantiX | Game (IOI13_game) | C++17 | 13073 ms | 19492 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>
#include "game.h"
using namespace std;
using ll = long long;
ll n, m, q, k, x, y, a, b, c;
struct segtree {
vector<ll> tr;
vector<ll> ur, ul, dr, dl;
segtree() {
tr.assign(1, 0);
ur.assign(1, -1);
ul.assign(1, -1);
dr.assign(1, -1);
dl.assign(1, -1);
}
void extend(ll x) {
for (int i = 0; i < 4; i++) {
tr.push_back(0);
ul.push_back(-1);
ur.push_back(-1);
dl.push_back(-1);
dr.push_back(-1);
}
ul[x] = tr.size() - 4;
ur[x] = tr.size() - 3;
# | 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... |