| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1331487 | tuncay_pasha | Game (IOI14_game) | C++20 | 1 ms | 344 KiB |
#include "game.h"
int count[1500], N;
void initialize(int n) {
N = n;
for (int i = 0; i < n; i++)
count[i] = 0;
}
int hasEdge(int u, int v) {
int target = (u < v) ? u : v;
count[target]++;
if (count[target] == target)
return 1;
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... | ||||
