# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
982531 | vjudge1 | Swapping Cities (APIO20_swap) | C++17 | 253 ms | 53360 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>
#include "swap.h"
using namespace std;
using ll = long long;
const int N = 300300;
const int INF = 1e9;
struct edge {
int u;
int v;
int w;
};
int bg[N];
int en[N];
int cap[N];
bool isbam[N];
int head[N];
int par[N][18];
vector<edge> edges;
int find(int x) {
return head[x] = (head[x] == x ? x : find(head[x]));
};
# | 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... |