# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
953737 | Trisanu_Das | Connecting Supertrees (IOI20_supertrees) | 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 <bits/stdc++.h>
using namespace std;
#include "supertrees.h"
int n, par[1005];
int find(int u){
return (par[u] == u ? u : find(par[u]));
}
void union(int u, int v){
par[find(u)] = find(b);
}
int construct(vector<vector<int> > p){
n = p.size();
for(int i = 0; i < n; i++) par[i] = i;
vector<vector<int> > b(n, vector<int>(n));
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(p[i][j] && find(i) != find(j)){
union(i, j);
adj[i][j] = adj[j][i] = 1;
}else if(!p[i][j] && find(i) == find(j)) return 0;
}
}
build(b);
return 1;
}