Submission #984174

#TimeUsernameProblemLanguageResultExecution timeMemory
984174vjudge1Game (APIO22_game)C++17
0 / 100
0 ms344 KiB
#include <bits/stdc++.h> #include "game.h" using namespace std; const int N = 30300; int n, k; bitset<N> reach[N]; void init(int N, int K) { n = N, k = K; for (int i = n - 1; i >= 0; i--) { reach[i][i] = 1; if (i < k - 1) reach[i] |= reach[i + 1]; } } int add_teleporter(int u, int v) { if (u == v && u < k) return 1; if (v < k) { if (reach[v][u]) return 1; } reach[u] |= reach[v]; if (u < k) { for (int i = 0; i < k; i++) { if (reach[u][i]) return 1; } } return 0; }
#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...