Submission #957614

#TimeUsernameProblemLanguageResultExecution timeMemory
957614vjudge1게임 (APIO22_game)C++17
2 / 100
1 ms596 KiB
#include <bits/stdc++.h> using namespace std; const int maxn = 1e3 + 100; int n, k, t; vector<int> g[maxn]; int used[maxn]; bool ok(int v){ used[v] = 1; for(int to: g[v]){ if(used[to] == 1) return 1; if(!used[to] && ok(to)) return 1; } used[v] = 2; return 0; } void init(int N, int K){ n = N; k = K; for(int i = 1; i < k; i++){ g[i].push_back(i+1); } } int add_teleporter(int u, int v){ u++; v++; g[u].push_back(v); fill(used, used + n + 1, 0); for(int i = k; i > 0; i--){ if(ok(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...