| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 46536 | RayaBurong25_1 | Game (IOI14_game) | C++17 | 2 ms | 760 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"
int Cut[1505][1505];
int P[1505], Sz[1505];
int N;
int UF(int u)
{
return (P[u] == -1)?u:(P[u] = UF(P[u]));
}
void initialize(int n)
{
N = n;
int i;
for (i = 0; i < n; i++)
{
P[i] = -1;
Sz[i] = 1;
}
}
int hasEdge(int u, int v)
{
int pu = UF(u);
int pv = UF(v);
int i;
if (Cut[pu][pv] + 1 == Sz[pu]*Sz[pv])
{
P[pu] = pv;
for (i = 0; i < N; i++)
{
Cut[pv][UF(i)] += Cut[pu][UF(i)];
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||