| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1305809 | jojeonghoon | 게임 (APIO22_game) | C++20 | 3 ms | 428 KiB |
#include <bits/stdc++.h>
#include "game.h"
using namespace std;
const int LM=300100;
int N,K;
vector<int>G[LM];
void init(int N_, int K_){
N=N_;
K=K_;
}
int D[LM];
int dfs(int x, int w){
w+=x<K;
if(D[x]) return 1;
D[x]=w;
for(int i:G[x]){
if(dfs(i,w)) return 1;
}
D[x]=0;
return 0;
}
int add_teleporter(int u, int v){
G[u].push_back(v);
return dfs(u,1);
}
| # | 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... | ||||
