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 <bits/stdc++.h>
using namespace std;
const int N = 1000;
int tree_parent[N];
int find_tree_parent(int u) {
return u == tree_parent[u] ? u : find_tree_parent(tree_parent[u]);
}
int construct(vector<vector<int>> p) {
int n = p.size();
vector<vector<int>> ans(n, vector<int>(n));
for (int i=0 ; i<n ; i++) {
for (int j=0 ; j<n ; j++) {
if (p[i][j] == 3) {
return 0;
}
}
}
for (int i=0 ; i<n ; i++) {
tree_parent[i] = i;
}
for (int i=0 ; i<n ; i++) {
for (int j=i+1 ; j<n ; j++) {
if (p[i][j] == 1) {
int ii = find_tree_parent(i);
int jj = find_tree_parent(j);
if (ii != jj) {
tree_parent[ii] = jj;
ans[i][j] = ans[j][i] = 1;
}
}
}
}
build(ans);
return 1;
}
# | 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... |