| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1214726 | 12baater | Game (IOI14_game) | C++20 | 0 ms | 328 KiB |
#include "game.h"
#include <algorithm>
using namespace std;
int N,arr[1500];
void initialize(int n) {
N=n;
}
int hasEdge(int u, int v) {
if (arr[u] == N-2 || arr[v] == N-2) {
arr[u] = min(arr[u],arr[v]);
arr[v] = arr[u];
return 1;
}
arr[u]++;
arr[v]++;
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... | ||||
