# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
673930 | c2zi6 | Swapping Cities (APIO20_swap) | C++14 | 444 ms | 14132 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 EDGE {
int u, v, w;
};
struct DSUNODE;
vector<DSUNODE> nodes;
struct DSUNODE {
int vert;
int parent;
int distToParent;
int size;
int left;
int right;
int when;
int leader(int mxpath = 2e9) {
if (parent == -1 || distToParent > mxpath) return vert;
return nodes[nodes[parent].leader(mxpath)].vert;
}
};
vector<EDGE> edges;
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
edges = vector<EDGE>(M);
# | 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... |