#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
struct uf {
vector<int> chefs;
uf (int n) {
chefs.resize(n);
for (int i = 0; i<n; i++) chefs[i] = i;
}
int find(int x) {
if (chefs[x] == x) return x;
return chefs[x] = find(chefs[x]);
}
void unite(int a, int b) {
a = find(a);
b = find(b);
chefs[a] = b;
}
};
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
if (n == 1) {
if (p[0][0] == 1) {
build({{0}});
return 1;
}
return 0;
}
vector<vector<int>> answer(n, vector<int>(n));
uf u(n);
for (int i = 0; i<n; i++) {
for (int j = 0; j<n; j++) {
if (p[i][j]) u.unite(i, j);
}
}
for (int i = 0; i<n; i++) {
for (int j = 0; j<n; j++) {
if (p[i][j] != (u.find(i) == u.find(j))) return -1;
}
}
vector<vector<int>> vals(n);
for (int i = 0; i<n; i++) {
for (int j = 0; j<n; j++) {
if (u.find(j) == i) vals[i].push_back(j);
}
}
for (auto v: vals) {
for (int i = 0; i<(int)(v.size())-1; i++) {
answer[v[i]][v[i+1]] = 1;
answer[v[i+1]][v[i]] = 1;
}
}
build(answer);
return 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
7 ms |
1132 KB |
Output is correct |
7 |
Correct |
153 ms |
22028 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
7 ms |
1132 KB |
Output is correct |
7 |
Correct |
153 ms |
22028 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
6 ms |
1180 KB |
Output is correct |
13 |
Correct |
144 ms |
22028 KB |
Output is correct |
14 |
Incorrect |
0 ms |
212 KB |
WA in grader: Invalid return value of construct |
15 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Incorrect |
0 ms |
212 KB |
WA in grader: Invalid return value of construct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
WA in grader: Invalid return value of construct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
7 ms |
1132 KB |
Output is correct |
7 |
Correct |
153 ms |
22028 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
6 ms |
1180 KB |
Output is correct |
13 |
Correct |
144 ms |
22028 KB |
Output is correct |
14 |
Incorrect |
0 ms |
212 KB |
WA in grader: Invalid return value of construct |
15 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
7 ms |
1132 KB |
Output is correct |
7 |
Correct |
153 ms |
22028 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
6 ms |
1180 KB |
Output is correct |
13 |
Correct |
144 ms |
22028 KB |
Output is correct |
14 |
Incorrect |
0 ms |
212 KB |
WA in grader: Invalid return value of construct |
15 |
Halted |
0 ms |
0 KB |
- |