Submission #983806

#TimeUsernameProblemLanguageResultExecution timeMemory
983806vjudge1Game (APIO22_game)C++17
12 / 100
4034 ms5692 KiB
#include <time.h> #include <cstdlib> #include <stack> #include <numeric> #include <unordered_map> #include <unordered_set> #include <iomanip> #include <map> #include <set> #include <iterator> #include <deque> #include <queue> #include <sstream> #include <array> #include <string> #include <tuple> #include <chrono> #include <cassert> #include <cstdio> #include <cstring> #include <list> #include <iostream> #include <vector> #include <cmath> #include <algorithm> #include <bitset> #include "game.h" #define ll long long using namespace std; vector<int> g[200005]; bool ok = 0, f = 0;; bool us[200005]; int N, K; void dfs(int p, int d){ us[p] = 1; for(int to : g[p]){ if(to == d) f = 1; if(us[to]) continue; dfs(to, d); } } void init(int n, int k){ for(int i = 0; i < k - 1; i++) g[i].push_back(i + 1); N = n; K = k; } int add_teleporter(int u, int v) { g[u].push_back(v); for(int i = 0; i < K; i++){ for(int j = 0; j <= N; j++) us[j] = 0; f = 0; dfs(i, i); if(f == 1) 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...