| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 585546 | SeDunion | Game (IOI14_game) | C++17 | 1 ms | 312 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "game.h"
#include<iostream>
const int N = 2000;
int deg[N];
void initialize(int n) {
for (int i = 0 ; i < n ; ++ i) {
deg[i] = n - 1;
}
}
int hasEdge(int u, int v) {
deg[u]--;
deg[v]--;
if (!deg[u] || !deg[v]) return 1;
else 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... | ||||
