# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
123893 | turbat | Game (IOI14_game) | C++14 | 2 ms | 376 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 <bits/stdc++.h>
#include "game.h"
using namespace std;
int cnt, n, c[1505], d[1505];
void initialize(int n) {:: n = n;}
int hasEdge(int u, int v) {
c[u]++, c[v]++;
if (d[u] || d[v]) return 1;
if (c[u] == n - 2) d[u] = 1, cnt++;
if (c[v] == n - 2) d[v] = 1, cnt++;
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... |