제출 #957613

#제출 시각아이디문제언어결과실행 시간메모리
957613vjudge1게임 (APIO22_game)C++17
2 / 100
1 ms344 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] = t; for(int to: g[v]){ if(used[to] == t) return 1; if(used[to] != t + 1 && ok(to)) return 1; } used[v] = t + 1; 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++; t += 2; g[u].push_back(v); 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...