| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1160609 | Aviansh | 게임 (APIO22_game) | C++17 | 0 ms | 408 KiB |
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
vector<unordered_set<int>>g;
vector<int>vis;
int myk;
int myn;
void init(int n, int k) {
myk=k;
myn=n;
for(int i = 0;i<n;i++){
g.push_back(unordered_set<int>());
vis.push_back(0);
}
for(int i = 0;i<k-1;i++){
g[i].insert(i+1);
}
}
int ans = 0;
void dfs(int st){
assert(st>=0);
assert(st<myn);
vis[st]=1;
for(int i : g[st]){
if(vis[i]==2){
continue;
}
if(vis[i]==1){
if(i<myk){
ans=1;
}
continue;
}
dfs(i);
}
vis[st]=2;
}
int add_teleporter(int u, int v) {
assert(myn>0);
g[u].insert(v);
fill(vis.begin(),vis.end(),0);
dfs(0);
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
