# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
831858 | andrey27_sm | Fountain Parks (IOI21_parks) | C++17 | 0 ms | 0 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 "parks.h"
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>> cons[200001];
int mask_l[200001];
vector<int> u;
vector<int> v;
vector<int> a;
vector<int> b;
struct dsu{
int sz = 0;
vector<int> pr;
int p(int v){
if(pr[v] == v) return v;
return pr[v] = p(pr[v]);
}
bool un(int u,int v){
u = p(u);
v = p(v);
if(u == v){
return 0;
exit(1);
}
pr[u] = v;
sz++;
return 1;
}
} D;
int construct_roads(vector<int> x, vector<int> y) {
int n = x.size();