| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1343206 | x93bd0 | Game (IOI14_game) | C++20 | 0 ms | 344 KiB |
#include "game.h"
#include <algorithm>
int N, C[1500];
void initialize(int n) {
std::fill(C, C + n, 0);
N = n;
}
int hasEdge(int u, int v) {
C[u]++;
C[v]++;
return C[u] == N || C[v] == N;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
