# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
713008 | piOOE | Game (APIO22_game) | C++17 | 1363 ms | 52488 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>
constexpr int N = 3e5 + 7, B = 8, inf = 1e9 + 7;
int fromMe[N], toMe[N], used[2][N], n, k; //smallest from me, biggest to me
std::vector<int> adj[N], rev[N];
bool found = false;
int save[2][N], level[N];
void init(int n, int k) {
::n = n, ::k = k;
for (int i = 0; i < n; ++i) {
if (i >= k) {
fromMe[i] = inf, toMe[i] = -inf;
} else {
fromMe[i] = toMe[i] = i;
}
level[i] = std::__lg(k);
}
memset(save[0], 0x3f, sizeof(save[0]));
memset(save[1], -0x3f, sizeof(save[1]));
}
void dfs2(int v, int x);
# | 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... |