| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 432467 | MilosMilutinovic | 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;
const int MAXN = 1505;
int parent[MAXN];
int root(int u) {
return parent[u] ^ u ? parent[u] = root(parent[u]) : u;
}
void unite(int u, int v) {
u = root(u);
v = root(v);
parent[u] = v;
}
int hasEdge(int u, int v);
void initialize(int N) {
for (int i = 0; i < N; i++)
parent[i] = i;
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
if (root(i) != root(j))
if (hasEdge(i, j))
unite(i, j);
}