Submission #983824

#TimeUsernameProblemLanguageResultExecution timeMemory
983824vjudge1Game (APIO22_game)C++17
0 / 100
1 ms1112 KiB
#include "game.h" #include<bits/stdc++.h> using namespace std; const int N = 3e4 + 100; vector<int> g[N]; bool flag = 0; int k, visited[N], n; void dfs(int x) { visited[x] = 1; for (auto to : g[x]) { if (!visited[to]) dfs(to); else if (to < k) flag = 1; } } void init(int n, int k) { ::k = k; ::n = n; for (int i = 0; i < k - 1; i++) { g[i].push_back(i + 1); } } int add_teleporter(int u, int v) { g[u].push_back(v); for (int i = 0; i < n; i++) { visited[i] = 0; } for (int i = 0; i < k; i++) { if (!visited[i]) dfs(i); } return flag; }
#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...