# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
965038 | Pannda | Swapping Cities (APIO20_swap) | C++17 | 2064 ms | 524288 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 "swap.h"
#include <bits/stdc++.h>
using namespace std;
struct DSU {
vector<int> f;
vector<int> siz;
vector<int> deg;
vector<bool> ok;
DSU(int n) : f(n), siz(n, 1), deg(n, 0), ok(n, false) { iota(f.begin(), f.end(), 0); }
int leader(int u) {
while (u != f[u]) u = f[u] = f[f[u]];
return u;
}
bool unionize(int u0, int v0) {
int u = leader(u0);
int v = leader(v0);
if (u == v) {
ok[u] = true;
return false;
}
if (siz[u] > siz[v]) swap(u, v);
siz[v] += siz[u];
if (++deg[u0] >= 3 || ++deg[v0] >= 3) ok[v] = true;
ok[v] = ok[v] | ok[u];
f[u] = v;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |