| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 146588 | karma | Game (IOI14_game) | C++11 | 2 ms | 380 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[2000], n, full = 0;
int hasEdge(int u, int v)
{
++cnt[u], ++cnt[v];
if(cnt[u] == n) ++full;
if(cnt[v] == n) ++full;
if(full < n - 1 && (cnt[u] == n || cnt[v] == n)) return 1;
return 0;
}
void initialize(int _n) {
n = _n; full = 0; fill(cnt, cnt + n + 2, 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... | ||||
