제출 #739129

#제출 시각아이디문제언어결과실행 시간메모리
739129PixelCat게임 (APIO22_game)C++17
2 / 100
9 ms8528 KiB
#include "game.h" #ifdef NYAOWO #include "grader.cpp" #endif #include <bits/stdc++.h> #define For(i, a, b) for(int i = a; i <= b; i++) #define Forr(i, a, b) for(int i = a; i >= b; i--) #define F first #define S second #define sz(x) ((int)x.size()) #define all(x) x.begin(), x.end() #define eb emplace_back using namespace std; using LL = long long; using pii = pair<int, int>; const int MAXN = 300030; int n, k; vector<int> adj[MAXN]; int vis[MAXN]; void init(int _n, int _k) { n = _n; k = _k; For(i, 0, n - 1) { adj[i].clear(); } } int dfs(int x, int t) { if(vis[x] != -1) return vis[x]; vis[x] = 0; for(auto &i:adj[x]) { if(i <= t) return vis[x] = 1; if(dfs(i, t)) return vis[x] = 1; } return vis[x]; } int add_teleporter(int u, int v) { if(u < k && v < k && u < v) return 0; memset(vis, -1, sizeof(vis)); adj[u].eb(v); int ok = 0; For(i, 0, k - 1) ok = max(ok, dfs(i, i)); return ok; }
#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...