Submission #1225034

#TimeUsernameProblemLanguageResultExecution timeMemory
1225034JerGame (APIO22_game)C++20
0 / 100
4 ms7440 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){ if (vis.find(i) != vis.end()) return i < k; vis.insert(i); for (auto j : con[i]) if (check(j)) 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); }
#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...