Submission #601978

#TimeUsernameProblemLanguageResultExecution timeMemory
601978patrikpavic2Game (APIO22_game)C++17
0 / 100
15 ms23760 KiB
#include "game.h" #include <vector> #include <cstdio> #define PB push_back using namespace std; const int N = 5e5 + 500; int n, k, ans; vector < int > v[N], r[N]; int L[N], R[N]; void init(int _n, int _k) { n = _n, k = _k; for(int i = 0;i < n;i++) L[i] = n, R[i] = -1; for(int i = 0;i < k;i++) L[i] = i, R[i] = i; } void noviL(int x, int vr){ L[x] = vr; for(int y : r[x]) if(vr < L[y]) noviL(y, vr); } void noviR(int x, int vr){ R[x] = vr; for(int y : v[x]) if(vr > R[y]) noviR(y, vr); } int add_teleporter(int a, int b) { if(a >= b && a < k) ans = 1; if(L[b] < L[a]) noviL(a, L[b]); if(R[a] > R[b]) noviR(b, R[a]); ans |= L[a] <= R[b]; return ans; }
#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...