# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
32319 | minimario | Toll (APIO13_toll) | C++14 | 1866 ms | 20340 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 MAX = 300005;
typedef pair<int, int> pii;
typedef long long ll;
#define f first
#define s second
int id[MAX], sz[MAX];
void init(int n) {
for (int i=0; i<=n; i++) {
id[i] = i;
sz[i] = 1;
}
}
int root(int u) {
while (u != id[u]) {
id[u] = id[id[u]];
u = id[u];
}
return u;
}
void join(int u, int v) {
u = root(u); v = root(v);
if (sz[u] < sz[v]) {
swap(u, v);
}
id[v] = u;
sz[u] += sz[v];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |