# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
224199 | jamielim | Putovanje (COCI20_putovanje) | C++14 | 172 ms | 36340 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>
using namespace std;
typedef long long ll;
typedef pair <int,int> pii;
typedef pair <ll, ll> pll;
const int MAXN = 200100;
int n;
struct UnionFind {
vector <int> v[MAXN];
int connected[MAXN],par[MAXN];
void init() {
for(int i=0;i<MAXN;i++){
v[i].clear();v[i].push_back(i);
par[i]=i;
connected[i]=0;
}
}
void merge(int a, int b) {
a = par[a];b = par[b];
if ((int)v[a].size() < (int)v[b].size()) swap(a, b); //merging smaller into larger
for (auto x : v[b]) {
if (par[x - 1] == a) connected[a]++;
if (par[x + 1] == a) connected[a]++;
v[a].push_back(x);
}
for (auto x : v[b]) par[x] = a;
connected[a] += connected[b];
}
int get(int x) { //number of times the edge from x to its parent (original tree) is used
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... |