# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
702727 | math_rabbit_1028 | Game (IOI14_game) | C++14 | 0 ms | 0 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 <bits/stdc++.h>
using namespace std;
int root[1515], dep[1515], can[1515], comp, last;
void initialize(int n) {
for (int i = 0; i < n; i++) cnt[i] = 0;
}
int hasEdge(int u, int v) {
if (u > v) swap(u, v);
cnt[v]++;
if (cnt[v] == v) return 1;
else return 0;
}