# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
383117 | ScarletS | Game (IOI14_game) | C++17 | 496 ms | 22004 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>
using namespace std;
const int N = 1500;
int n, pt[N], sz[N], e[N][N];
int find(int x)
{
if (x==pt[x])
return x;
return pt[x] = find(pt[x]);
}
void unite(int x, int y)
{
if (sz[y]>sz[x])
swap(x,y);
pt[y]=x;
sz[x]+=sz[y];
for (int i=0;i<n;++i)
{
e[x][i]+=e[y][i];
e[i][x]=e[x][i];
}
}
int hasEdge(int u, int v)
{
int x = find(u), y = find(v);
if (x == y)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |