#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int sz[1001],par[1001];
int find(int a){
if(a==par[a]) return a;
int x=find(par[a]);
par[a]=x;
return x;
}
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
for(int i=0;i<n;i++){
sz[i]=1;
par[i]=i;
for(int j=0;j<n;j++){
if(p[i][j]==3) return 0;
}
}
if(n==1){
build({{0}});
return 1;
}
std::vector<std::vector<int>> answer(n,vector<int> (n,0));
for (int i = 0; i < n; i++) {
for(int j=0;j<n;j++){
int x=find(i);
int y=find(j);
if(p[i][j]==0 && x==y) return 0;
if(p[i][j]==1){
if(x==y) continue;
if(sz[x]<sz[y]) swap(x,y);
else if(sz[x]==sz[y] && x>y) swap(x,y);
sz[x]+=sz[y];
par[y]=x;
answer[x][y]=1;
answer[y][x]=1;
}
}
}
build(answer);
return 1;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
6 ms |
1116 KB |
Output is correct |
7 |
Correct |
166 ms |
22148 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
6 ms |
1116 KB |
Output is correct |
7 |
Correct |
166 ms |
22148 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
600 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
416 KB |
Output is correct |
12 |
Correct |
7 ms |
1368 KB |
Output is correct |
13 |
Correct |
161 ms |
23988 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
0 ms |
348 KB |
Output is correct |
16 |
Correct |
3 ms |
860 KB |
Output is correct |
17 |
Correct |
67 ms |
14164 KB |
Output is correct |
18 |
Correct |
0 ms |
348 KB |
Output is correct |
19 |
Correct |
1 ms |
548 KB |
Output is correct |
20 |
Correct |
52 ms |
6404 KB |
Output is correct |
21 |
Correct |
157 ms |
24032 KB |
Output is correct |
22 |
Correct |
163 ms |
23928 KB |
Output is correct |
23 |
Correct |
161 ms |
23892 KB |
Output is correct |
24 |
Correct |
160 ms |
24252 KB |
Output is correct |
25 |
Correct |
71 ms |
14200 KB |
Output is correct |
26 |
Correct |
69 ms |
14092 KB |
Output is correct |
27 |
Correct |
160 ms |
23944 KB |
Output is correct |
28 |
Correct |
169 ms |
24144 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Incorrect |
0 ms |
348 KB |
Answer gives possible 1 while actual possible 0 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 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 |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
6 ms |
1116 KB |
Output is correct |
7 |
Correct |
166 ms |
22148 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
600 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
416 KB |
Output is correct |
12 |
Correct |
7 ms |
1368 KB |
Output is correct |
13 |
Correct |
161 ms |
23988 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
0 ms |
348 KB |
Output is correct |
16 |
Correct |
3 ms |
860 KB |
Output is correct |
17 |
Correct |
67 ms |
14164 KB |
Output is correct |
18 |
Correct |
0 ms |
348 KB |
Output is correct |
19 |
Correct |
1 ms |
548 KB |
Output is correct |
20 |
Correct |
52 ms |
6404 KB |
Output is correct |
21 |
Correct |
157 ms |
24032 KB |
Output is correct |
22 |
Correct |
163 ms |
23928 KB |
Output is correct |
23 |
Correct |
161 ms |
23892 KB |
Output is correct |
24 |
Correct |
160 ms |
24252 KB |
Output is correct |
25 |
Correct |
71 ms |
14200 KB |
Output is correct |
26 |
Correct |
69 ms |
14092 KB |
Output is correct |
27 |
Correct |
160 ms |
23944 KB |
Output is correct |
28 |
Correct |
169 ms |
24144 KB |
Output is correct |
29 |
Correct |
0 ms |
348 KB |
Output is correct |
30 |
Correct |
0 ms |
344 KB |
Output is correct |
31 |
Correct |
0 ms |
344 KB |
Output is correct |
32 |
Incorrect |
0 ms |
348 KB |
Answer gives possible 1 while actual possible 0 |
33 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
6 ms |
1116 KB |
Output is correct |
7 |
Correct |
166 ms |
22148 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
600 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
416 KB |
Output is correct |
12 |
Correct |
7 ms |
1368 KB |
Output is correct |
13 |
Correct |
161 ms |
23988 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
0 ms |
348 KB |
Output is correct |
16 |
Correct |
3 ms |
860 KB |
Output is correct |
17 |
Correct |
67 ms |
14164 KB |
Output is correct |
18 |
Correct |
0 ms |
348 KB |
Output is correct |
19 |
Correct |
1 ms |
548 KB |
Output is correct |
20 |
Correct |
52 ms |
6404 KB |
Output is correct |
21 |
Correct |
157 ms |
24032 KB |
Output is correct |
22 |
Correct |
163 ms |
23928 KB |
Output is correct |
23 |
Correct |
161 ms |
23892 KB |
Output is correct |
24 |
Correct |
160 ms |
24252 KB |
Output is correct |
25 |
Correct |
71 ms |
14200 KB |
Output is correct |
26 |
Correct |
69 ms |
14092 KB |
Output is correct |
27 |
Correct |
160 ms |
23944 KB |
Output is correct |
28 |
Correct |
169 ms |
24144 KB |
Output is correct |
29 |
Correct |
0 ms |
348 KB |
Output is correct |
30 |
Correct |
0 ms |
344 KB |
Output is correct |
31 |
Correct |
0 ms |
344 KB |
Output is correct |
32 |
Incorrect |
0 ms |
348 KB |
Answer gives possible 1 while actual possible 0 |
33 |
Halted |
0 ms |
0 KB |
- |