Submission #713008

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
7130082023-03-20 19:54:05piOOEGame (APIO22_game)C++17
100 / 100
1363 ms52488 KiB
#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);
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...