# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
699460 | He_Huanglu | Swapping Cities (APIO20_swap) | C++17 | 1 ms | 468 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>
#define ii pair<int, int>
#define iii pair<int, ii>
#define fi first
#define se second
using namespace std;
const int N = 2e5 + 5;
int n, m, par[N], p1[N], p2[N], past[N], cur[N];
vector <iii> edg;
int root(int u)
{
return (par[u] < 0) ? u : par[u] = root(par[u]);
}
bool check(int u, int v, int mid)
{
while (par[u] > 0 && past[u] <= mid) u = par[u];
while (par[v] > 0 && past[v] <= mid) v = par[v];
if(u != v) return 0;
if(cur[u] && cur[u] <= mid) return 1;
return 0;
}
void join(int u, int v, int w)
{
u = root(u), v = root(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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |