# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
406433 | tengiz05 | Swapping Cities (APIO20_swap) | C++17 | 2008 ms | 53668 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>
constexpr int N = 3e5 + 5;
int n, m;
int up[N][20], f[N], ans[N], tin[N], tout[N];
std::vector<int> e[N], to[N];
struct desu{
std::vector<int> p;
desu(int n){
p.assign(n, 0);
iota(p.begin(), p.end(), 0);
}
int leader(int u){
while (p[u] != u) u = p[u] = p[p[u]];
return u;
}
void merge(int u, int v){
u = leader(u);
v = leader(v);
if (u == v) return;
p[v] = u;
}
bool same(int u, int v){
return leader(u) == leader(v);
}
}d(N);
int timer = 0;
void dfs(int u, int p){
tin[u] = timer++;
up[u][0] = p;
# | 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... |