#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > d;
vector<int> C[1004];
int par[1004], num = 0;
int findpar(int N) {
if (N == par[N]) return N;
else return par[N] = findpar(par[N]);
}
void merge(int a, int b) {
int aa = findpar(a), bb = findpar(b);
par[aa] = bb;
}
int construct(vector<vector<int> > v) {
int n = v.size();
for (int i=0; i<n; i++) par[i] = i;
d.resize(n);
for (int i=0; i<n; i++) d[i].resize(n);
// checking
int type = 0;
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
if (v[i][j] == 2) type = 2;
if (v[i][j] == 1) type = 1;
}
}
if (type == 2) {
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (v[i][j] == 2 && i != j) merge(i, j);
}
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (v[i][j] == 0) {
if (findpar(i) == findpar(j)) return 0;
}
}
}
for (int i = 0; i < n; i++) par[i] = findpar(i);
for (int i = 0; i < n; i++) C[par[i]].push_back(i);
for (int i = 0; i < n; i++) {
int cnt = 0;
if (C[i].size() == 2) return 0;
else if (C[i].size() >= 3) {
for (int j = 0; j < C[i].size() - 1; j++) {
d[C[i][j]][C[i][j + 1]] = 1, d[C[i][j + 1]][C[i][j]] = 1;
}
d[C[i][C[i].size() - 1]][C[i][0]] = 1, d[C[i][0]][C[i][C[i].size() - 1]] = 1;
}
}
}
else {
for (int i=0; i<n; i++) {
for (int j=i + 1; j < n; j++) {
if (v[i][j] == 1 && i != j) merge(i, j);
}
}
for (int i=0; i<n; i++) {
for (int j=i + 1; j < n; j++) {
if (v[i][j] == 0) {
if (findpar(i) == findpar(j)) return 0;
}
}
}
for (int i=0; i<n; i++) par[i] = findpar(i);
for (int i=0; i<n; i++) C[par[i]].push_back(i);
for (int i=0; i<n; i++) {
for (int j=0; j<C[i].size(); j++) {
if (C[i][j] != i) d[i][C[i][j]] = 1, d[C[i][j]][i] = 1;
}
}
}
build(d);
return 1;
}
Compilation message
supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:55:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
55 | for (int j = 0; j < C[i].size() - 1; j++) {
| ~~^~~~~~~~~~~~~~~~~
supertrees.cpp:52:8: warning: unused variable 'cnt' [-Wunused-variable]
52 | int cnt = 0;
| ^~~
supertrees.cpp:78:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
78 | for (int j=0; j<C[i].size(); j++) {
| ~^~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
384 KB |
Output is correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Correct |
0 ms |
384 KB |
Output is correct |
6 |
Correct |
10 ms |
1280 KB |
Output is correct |
7 |
Correct |
239 ms |
22132 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
384 KB |
Output is correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Correct |
0 ms |
384 KB |
Output is correct |
6 |
Correct |
10 ms |
1280 KB |
Output is correct |
7 |
Correct |
239 ms |
22132 KB |
Output is correct |
8 |
Correct |
0 ms |
384 KB |
Output is correct |
9 |
Correct |
1 ms |
384 KB |
Output is correct |
10 |
Correct |
1 ms |
384 KB |
Output is correct |
11 |
Correct |
1 ms |
384 KB |
Output is correct |
12 |
Correct |
10 ms |
1280 KB |
Output is correct |
13 |
Correct |
232 ms |
22200 KB |
Output is correct |
14 |
Correct |
0 ms |
384 KB |
Output is correct |
15 |
Correct |
0 ms |
384 KB |
Output is correct |
16 |
Correct |
5 ms |
896 KB |
Output is correct |
17 |
Correct |
108 ms |
12152 KB |
Output is correct |
18 |
Correct |
1 ms |
384 KB |
Output is correct |
19 |
Correct |
0 ms |
384 KB |
Output is correct |
20 |
Correct |
60 ms |
5868 KB |
Output is correct |
21 |
Correct |
238 ms |
22136 KB |
Output is correct |
22 |
Correct |
259 ms |
22264 KB |
Output is correct |
23 |
Correct |
250 ms |
22136 KB |
Output is correct |
24 |
Correct |
232 ms |
22320 KB |
Output is correct |
25 |
Correct |
111 ms |
12152 KB |
Output is correct |
26 |
Correct |
99 ms |
12152 KB |
Output is correct |
27 |
Correct |
247 ms |
22136 KB |
Output is correct |
28 |
Correct |
230 ms |
22264 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
384 KB |
Output is correct |
4 |
Incorrect |
0 ms |
384 KB |
Answer gives possible 1 while actual possible 0 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Incorrect |
0 ms |
384 KB |
Too few ways to get from 0 to 1, should be 2 found 0 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
384 KB |
Output is correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Correct |
0 ms |
384 KB |
Output is correct |
6 |
Correct |
10 ms |
1280 KB |
Output is correct |
7 |
Correct |
239 ms |
22132 KB |
Output is correct |
8 |
Correct |
0 ms |
384 KB |
Output is correct |
9 |
Correct |
1 ms |
384 KB |
Output is correct |
10 |
Correct |
1 ms |
384 KB |
Output is correct |
11 |
Correct |
1 ms |
384 KB |
Output is correct |
12 |
Correct |
10 ms |
1280 KB |
Output is correct |
13 |
Correct |
232 ms |
22200 KB |
Output is correct |
14 |
Correct |
0 ms |
384 KB |
Output is correct |
15 |
Correct |
0 ms |
384 KB |
Output is correct |
16 |
Correct |
5 ms |
896 KB |
Output is correct |
17 |
Correct |
108 ms |
12152 KB |
Output is correct |
18 |
Correct |
1 ms |
384 KB |
Output is correct |
19 |
Correct |
0 ms |
384 KB |
Output is correct |
20 |
Correct |
60 ms |
5868 KB |
Output is correct |
21 |
Correct |
238 ms |
22136 KB |
Output is correct |
22 |
Correct |
259 ms |
22264 KB |
Output is correct |
23 |
Correct |
250 ms |
22136 KB |
Output is correct |
24 |
Correct |
232 ms |
22320 KB |
Output is correct |
25 |
Correct |
111 ms |
12152 KB |
Output is correct |
26 |
Correct |
99 ms |
12152 KB |
Output is correct |
27 |
Correct |
247 ms |
22136 KB |
Output is correct |
28 |
Correct |
230 ms |
22264 KB |
Output is correct |
29 |
Correct |
1 ms |
384 KB |
Output is correct |
30 |
Correct |
0 ms |
384 KB |
Output is correct |
31 |
Correct |
0 ms |
384 KB |
Output is correct |
32 |
Incorrect |
0 ms |
384 KB |
Answer gives possible 1 while actual possible 0 |
33 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
384 KB |
Output is correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Correct |
0 ms |
384 KB |
Output is correct |
6 |
Correct |
10 ms |
1280 KB |
Output is correct |
7 |
Correct |
239 ms |
22132 KB |
Output is correct |
8 |
Correct |
0 ms |
384 KB |
Output is correct |
9 |
Correct |
1 ms |
384 KB |
Output is correct |
10 |
Correct |
1 ms |
384 KB |
Output is correct |
11 |
Correct |
1 ms |
384 KB |
Output is correct |
12 |
Correct |
10 ms |
1280 KB |
Output is correct |
13 |
Correct |
232 ms |
22200 KB |
Output is correct |
14 |
Correct |
0 ms |
384 KB |
Output is correct |
15 |
Correct |
0 ms |
384 KB |
Output is correct |
16 |
Correct |
5 ms |
896 KB |
Output is correct |
17 |
Correct |
108 ms |
12152 KB |
Output is correct |
18 |
Correct |
1 ms |
384 KB |
Output is correct |
19 |
Correct |
0 ms |
384 KB |
Output is correct |
20 |
Correct |
60 ms |
5868 KB |
Output is correct |
21 |
Correct |
238 ms |
22136 KB |
Output is correct |
22 |
Correct |
259 ms |
22264 KB |
Output is correct |
23 |
Correct |
250 ms |
22136 KB |
Output is correct |
24 |
Correct |
232 ms |
22320 KB |
Output is correct |
25 |
Correct |
111 ms |
12152 KB |
Output is correct |
26 |
Correct |
99 ms |
12152 KB |
Output is correct |
27 |
Correct |
247 ms |
22136 KB |
Output is correct |
28 |
Correct |
230 ms |
22264 KB |
Output is correct |
29 |
Correct |
1 ms |
384 KB |
Output is correct |
30 |
Correct |
0 ms |
384 KB |
Output is correct |
31 |
Correct |
0 ms |
384 KB |
Output is correct |
32 |
Incorrect |
0 ms |
384 KB |
Answer gives possible 1 while actual possible 0 |
33 |
Halted |
0 ms |
0 KB |
- |