Submission #1225054

#TimeUsernameProblemLanguageResultExecution timeMemory
1225054JerGame (APIO22_game)C++20
2 / 100
6 ms7348 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 300005; vector<int> con[MAXN]; int n, k; set<int> vis; bool check(int i, int m){ if (vis.find(i) != vis.end()) return i < k and m >= i; vis.insert(i); if (i < k) m = max(i, m); for (auto j : con[i]) if (check(j, m)) return true; return false; } void init(int N, int K) { n = N, k = K; for (int i = 0; i < k - 1; i++) con[i].push_back(i + 1); } int add_teleporter(int u, int v) { con[u].push_back(v); vis.clear(); return check(0, -1); }
#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...