# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
666523 | YENGOYAN | Connecting Supertrees (IOI20_supertrees) | C++14 | 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 "supertrees.h"
#include <vector>
using namespace std;
vector<int> par, sizes;
int get(int u){
if(par[u] == u) return u;
return par[u] = get(par[u]);
}
void union_sets(int u, int v){
int a = get(u), b = get(v);
if(a == b) return;
if(sizes[a] < sizes[b]) swap(a, b);
par[b] = a;
sizes[a] += sizes[b];
}
int construct(vector<std::vector<int>> p) {
int n = p.size();
vector<vector<bool>> gp(n, vector<bool> (n));
par = sizes = vector<int> (n);
for(int i = 0; i < n;i++) par[i] = i, sizes[i] = 1;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(!p[i][j]) continue;
int u = get(i), v = get(j);
if(u != v) union_sets(u, v), gp[i][j] = gp[j][i] = 1;
}
}
build(gp);
return 1;
}