제출 #949410

#제출 시각아이디문제언어결과실행 시간메모리
949410Alfraganus게임 (APIO22_game)C++17
2 / 100
1 ms344 KiB
#include <bits/stdc++.h> #include "game.h" // #include "grader.cpp" using namespace std; const int N = 1001; int mx[N], K; vector<int> graph[N]; void init(int n, int k) { for(int i = 0; i < n; i ++) mx[i] = -1; for(int i = 0; i < k; i ++) mx[i] = i; K = k; } int add_teleporter(int u, int v) { if(u == v) return u < K; graph[u].push_back(v); queue<int> q; if(mx[v] < mx[u]) q.push(v), mx[v] = mx[u]; while(!q.empty()){ int x = q.front(); q.pop(); if(x < K) if(mx[x] >= x) return 1; for(int y : graph[x]) if(mx[y] < mx[x]) mx[y] = mx[x], q.push(y); } 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...