# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
109811 | arman_ferdous | Game (IOI14_game) | C++17 | 2 ms | 384 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;
const int N = 1510;
int p[N], cnt[N];
void initialize(int n) {
for(int i = 0; i <= n; i++)
p[i] = i, cnt[i] = n-1;
}
int find(int u) {
if(p[u] == u) return u;
return p[u] = find(p[u]);
}
int hasEdge(int u, int v) {
if(u < v) swap(u,v);
cnt[u]--, cnt[v]--;
if(find(u) == find(v)) {
if(cnt[u] == 0) return 1;
return 0;
}
if(cnt[u] == 0) {
p[find(u)] = find(v);
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... |