| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1299217 | gesp3011v2 | Game (IOI14_game) | C++20 | 1 ms | 568 KiB |
#include "bits/stdc++.h"
using namespace std;
#include "game.h"
const int N=2e3+10;
int cnt[N],n,k;
void initialize(int m){
n=m;
}
int hasEdge(int u, int v) {
cnt[u]++;
cnt[v]++;
if(cnt[u]==n-1 || cnt[v]==n-1)return 1;
else{
if(k==3)return 1;
k++;
return 0;
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
