#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
#define pb push_back
const int N=1050;
vector<int> E[N];
vector<vector<int>> p;
vector<int> par(N);
vector<vector<int>> ans(N,vector<int>(N,0));
void AddEdge(int u,int v){E[u].pb(v);E[v].pb(u);}
vector<int> Euler;
bool was[N];
void DFS1(int u){
was[u]=true,Euler.pb(u);
for(int v:E[u])if(!was[v]&&p[u][v]==1)DFS1(v);
}
void DFS2(int u){
was[u]=true,Euler.pb(u);
for(int v:E[u])if(!was[v]&&p[u][v]==2)DFS2(v);
}
int construct(vector<vector<int>> P){
p=P;int n=(int)P.size();
for(int i=0;i<n;i++)for(int j=0;j<n;j++)if(p[i][j]==3)return 0;
ans.resize(n);
for(int i=0;i<n;i++)ans[i].resize(n);
for(int i=0;i<n;i++)for(int j=0;j<n;j++)ans[i][j]=0;
for(int i=0;i<n;i++)for(int j=i+1;j<n;j++)if(p[i][j]>0)AddEdge(i,j);
bool one=false,two=false;
for(int i=0;i<n;i++)for(int j=i+1;j<n;j++)if(p[i][j]==1)one=true;
for(int i=0;i<n;i++)for(int j=i+1;j<n;j++)if(p[i][j]==2)two=true;
if(!one&&!two){build(ans);return 1;}
if(one&&!two){
for(int i=0;i<n;i++){
if(!was[i]){
DFS1(i);
if((int)Euler.size()==1){Euler.clear();continue;}
for(int x:Euler)for(int y:Euler)if(x!=y&&p[x][y]==0)return 0;
for(int i=1;i<(int)Euler.size();i++){
int x=Euler[i],y=Euler[i-1];
ans[x][y]=ans[y][x]=1;
}
Euler.clear();
}
}
build(ans);
return 1;
}
if(!one&&two){
for(int i=0;i<n;i++){
if(!was[i]){
DFS2(i);
if((int)Euler.size()==1){Euler.clear();continue;}
if((int)Euler.size()==2)return 0;
for(int x:Euler)for(int y:Euler)if(x!=y&&p[x][y]==0)return 0;
for(int i=1;i<(int)Euler.size();i++){
int x=Euler[i],y=Euler[i-1];
ans[x][y]=ans[y][x]=1;
}
if(Euler.size()>2){
int x=Euler[0],y=Euler.back();
ans[x][y]=ans[y][x]=1;
}
Euler.clear();
}
}
build(ans);
return 1;
}
if(one&&two){
vector<int> root;
for(int i=0;i<n;i++){
if(!was[i]){
DFS1(i);
if((int)Euler.size()==1){par[i]=i;Euler.clear();continue;}
for(int x:Euler)for(int y:Euler)if(x!=y&&p[x][y]!=1)return 0;
for(int x:Euler)par[x]=Euler[0];
for(int i=1;i<(int)Euler.size();i++){
int x=Euler[i],y=Euler[i-1];
ans[x][y]=ans[y][x]=1;
}
Euler.clear();
}
}
for(int i=0;i<n;i++)was[i]=false;
for(int i=0;i<n;i++){
if(!was[i]){
DFS2(i);
if((int)Euler.size()==1){Euler.clear();continue;}
if((int)Euler.size()==2)return 0;
for(int x:Euler)for(int y:Euler)if(x!=y&&p[x][y]==0)return 0;
for(int i=1;i<(int)Euler.size();i++){
int x=par[Euler[i]],y=par[Euler[i-1]];
ans[x][y]=ans[y][x]=1;
}
if((int)Euler.size()>2){
int x=par[Euler[0]],y=par[Euler.back()];
ans[x][y]=ans[y][x]=1;
}
Euler.clear();
}
}
build(ans);
return 1;
}
}
Compilation message
supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:105:1: warning: control reaches end of non-void function [-Wreturn-type]
105 | }
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4716 KB |
Output is correct |
2 |
Correct |
3 ms |
4716 KB |
Output is correct |
3 |
Correct |
3 ms |
4716 KB |
Output is correct |
4 |
Correct |
3 ms |
4716 KB |
Output is correct |
5 |
Correct |
3 ms |
4716 KB |
Output is correct |
6 |
Correct |
13 ms |
5228 KB |
Output is correct |
7 |
Correct |
281 ms |
30700 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4716 KB |
Output is correct |
2 |
Correct |
3 ms |
4716 KB |
Output is correct |
3 |
Correct |
3 ms |
4716 KB |
Output is correct |
4 |
Correct |
3 ms |
4716 KB |
Output is correct |
5 |
Correct |
3 ms |
4716 KB |
Output is correct |
6 |
Correct |
13 ms |
5228 KB |
Output is correct |
7 |
Correct |
281 ms |
30700 KB |
Output is correct |
8 |
Correct |
3 ms |
4716 KB |
Output is correct |
9 |
Correct |
3 ms |
4716 KB |
Output is correct |
10 |
Correct |
3 ms |
4716 KB |
Output is correct |
11 |
Correct |
4 ms |
4716 KB |
Output is correct |
12 |
Correct |
15 ms |
5228 KB |
Output is correct |
13 |
Correct |
250 ms |
26220 KB |
Output is correct |
14 |
Correct |
3 ms |
4716 KB |
Output is correct |
15 |
Correct |
3 ms |
4716 KB |
Output is correct |
16 |
Correct |
8 ms |
5228 KB |
Output is correct |
17 |
Correct |
120 ms |
19308 KB |
Output is correct |
18 |
Correct |
3 ms |
4716 KB |
Output is correct |
19 |
Correct |
3 ms |
4716 KB |
Output is correct |
20 |
Correct |
65 ms |
8272 KB |
Output is correct |
21 |
Correct |
254 ms |
26988 KB |
Output is correct |
22 |
Correct |
256 ms |
26476 KB |
Output is correct |
23 |
Correct |
262 ms |
28396 KB |
Output is correct |
24 |
Correct |
249 ms |
26348 KB |
Output is correct |
25 |
Correct |
107 ms |
16892 KB |
Output is correct |
26 |
Correct |
105 ms |
16620 KB |
Output is correct |
27 |
Correct |
266 ms |
29548 KB |
Output is correct |
28 |
Correct |
246 ms |
26220 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4716 KB |
Output is correct |
2 |
Correct |
3 ms |
4716 KB |
Output is correct |
3 |
Correct |
3 ms |
4716 KB |
Output is correct |
4 |
Correct |
3 ms |
4716 KB |
Output is correct |
5 |
Correct |
3 ms |
4716 KB |
Output is correct |
6 |
Correct |
3 ms |
4716 KB |
Output is correct |
7 |
Correct |
3 ms |
4716 KB |
Output is correct |
8 |
Correct |
13 ms |
5228 KB |
Output is correct |
9 |
Correct |
265 ms |
26348 KB |
Output is correct |
10 |
Correct |
3 ms |
4716 KB |
Output is correct |
11 |
Correct |
3 ms |
4716 KB |
Output is correct |
12 |
Correct |
13 ms |
5228 KB |
Output is correct |
13 |
Correct |
263 ms |
30444 KB |
Output is correct |
14 |
Correct |
4 ms |
4716 KB |
Output is correct |
15 |
Correct |
4 ms |
4716 KB |
Output is correct |
16 |
Correct |
8 ms |
5228 KB |
Output is correct |
17 |
Correct |
119 ms |
19180 KB |
Output is correct |
18 |
Correct |
3 ms |
4716 KB |
Output is correct |
19 |
Correct |
3 ms |
4716 KB |
Output is correct |
20 |
Correct |
3 ms |
4716 KB |
Output is correct |
21 |
Correct |
66 ms |
8300 KB |
Output is correct |
22 |
Correct |
255 ms |
26988 KB |
Output is correct |
23 |
Correct |
256 ms |
26348 KB |
Output is correct |
24 |
Correct |
261 ms |
29420 KB |
Output is correct |
25 |
Correct |
105 ms |
16492 KB |
Output is correct |
26 |
Correct |
111 ms |
16876 KB |
Output is correct |
27 |
Correct |
251 ms |
26476 KB |
Output is correct |
28 |
Correct |
263 ms |
28396 KB |
Output is correct |
29 |
Correct |
108 ms |
16492 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4716 KB |
Output is correct |
2 |
Correct |
3 ms |
4716 KB |
Output is correct |
3 |
Correct |
3 ms |
4716 KB |
Output is correct |
4 |
Correct |
68 ms |
8172 KB |
Output is correct |
5 |
Correct |
261 ms |
26860 KB |
Output is correct |
6 |
Correct |
258 ms |
26364 KB |
Output is correct |
7 |
Correct |
266 ms |
28396 KB |
Output is correct |
8 |
Correct |
3 ms |
4716 KB |
Output is correct |
9 |
Correct |
64 ms |
8172 KB |
Output is correct |
10 |
Correct |
250 ms |
26860 KB |
Output is correct |
11 |
Correct |
254 ms |
26424 KB |
Output is correct |
12 |
Correct |
267 ms |
29420 KB |
Output is correct |
13 |
Correct |
3 ms |
4716 KB |
Output is correct |
14 |
Correct |
3 ms |
4716 KB |
Output is correct |
15 |
Incorrect |
3 ms |
4716 KB |
Too few ways to get from 0 to 1, should be 2 found 1 |
16 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4716 KB |
Output is correct |
2 |
Correct |
3 ms |
4716 KB |
Output is correct |
3 |
Correct |
3 ms |
4716 KB |
Output is correct |
4 |
Correct |
3 ms |
4716 KB |
Output is correct |
5 |
Correct |
3 ms |
4716 KB |
Output is correct |
6 |
Correct |
13 ms |
5228 KB |
Output is correct |
7 |
Correct |
281 ms |
30700 KB |
Output is correct |
8 |
Correct |
3 ms |
4716 KB |
Output is correct |
9 |
Correct |
3 ms |
4716 KB |
Output is correct |
10 |
Correct |
3 ms |
4716 KB |
Output is correct |
11 |
Correct |
4 ms |
4716 KB |
Output is correct |
12 |
Correct |
15 ms |
5228 KB |
Output is correct |
13 |
Correct |
250 ms |
26220 KB |
Output is correct |
14 |
Correct |
3 ms |
4716 KB |
Output is correct |
15 |
Correct |
3 ms |
4716 KB |
Output is correct |
16 |
Correct |
8 ms |
5228 KB |
Output is correct |
17 |
Correct |
120 ms |
19308 KB |
Output is correct |
18 |
Correct |
3 ms |
4716 KB |
Output is correct |
19 |
Correct |
3 ms |
4716 KB |
Output is correct |
20 |
Correct |
65 ms |
8272 KB |
Output is correct |
21 |
Correct |
254 ms |
26988 KB |
Output is correct |
22 |
Correct |
256 ms |
26476 KB |
Output is correct |
23 |
Correct |
262 ms |
28396 KB |
Output is correct |
24 |
Correct |
249 ms |
26348 KB |
Output is correct |
25 |
Correct |
107 ms |
16892 KB |
Output is correct |
26 |
Correct |
105 ms |
16620 KB |
Output is correct |
27 |
Correct |
266 ms |
29548 KB |
Output is correct |
28 |
Correct |
246 ms |
26220 KB |
Output is correct |
29 |
Correct |
3 ms |
4716 KB |
Output is correct |
30 |
Correct |
3 ms |
4716 KB |
Output is correct |
31 |
Correct |
3 ms |
4716 KB |
Output is correct |
32 |
Correct |
3 ms |
4716 KB |
Output is correct |
33 |
Correct |
3 ms |
4716 KB |
Output is correct |
34 |
Correct |
3 ms |
4716 KB |
Output is correct |
35 |
Correct |
3 ms |
4716 KB |
Output is correct |
36 |
Correct |
13 ms |
5228 KB |
Output is correct |
37 |
Correct |
265 ms |
26348 KB |
Output is correct |
38 |
Correct |
3 ms |
4716 KB |
Output is correct |
39 |
Correct |
3 ms |
4716 KB |
Output is correct |
40 |
Correct |
13 ms |
5228 KB |
Output is correct |
41 |
Correct |
263 ms |
30444 KB |
Output is correct |
42 |
Correct |
4 ms |
4716 KB |
Output is correct |
43 |
Correct |
4 ms |
4716 KB |
Output is correct |
44 |
Correct |
8 ms |
5228 KB |
Output is correct |
45 |
Correct |
119 ms |
19180 KB |
Output is correct |
46 |
Correct |
3 ms |
4716 KB |
Output is correct |
47 |
Correct |
3 ms |
4716 KB |
Output is correct |
48 |
Correct |
3 ms |
4716 KB |
Output is correct |
49 |
Correct |
66 ms |
8300 KB |
Output is correct |
50 |
Correct |
255 ms |
26988 KB |
Output is correct |
51 |
Correct |
256 ms |
26348 KB |
Output is correct |
52 |
Correct |
261 ms |
29420 KB |
Output is correct |
53 |
Correct |
105 ms |
16492 KB |
Output is correct |
54 |
Correct |
111 ms |
16876 KB |
Output is correct |
55 |
Correct |
251 ms |
26476 KB |
Output is correct |
56 |
Correct |
263 ms |
28396 KB |
Output is correct |
57 |
Correct |
108 ms |
16492 KB |
Output is correct |
58 |
Correct |
3 ms |
4716 KB |
Output is correct |
59 |
Correct |
3 ms |
4716 KB |
Output is correct |
60 |
Correct |
8 ms |
5228 KB |
Output is correct |
61 |
Correct |
127 ms |
20844 KB |
Output is correct |
62 |
Correct |
3 ms |
4716 KB |
Output is correct |
63 |
Correct |
3 ms |
4716 KB |
Output is correct |
64 |
Correct |
4 ms |
4716 KB |
Output is correct |
65 |
Incorrect |
81 ms |
8172 KB |
b[11][11] is not 0 |
66 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4716 KB |
Output is correct |
2 |
Correct |
3 ms |
4716 KB |
Output is correct |
3 |
Correct |
3 ms |
4716 KB |
Output is correct |
4 |
Correct |
3 ms |
4716 KB |
Output is correct |
5 |
Correct |
3 ms |
4716 KB |
Output is correct |
6 |
Correct |
13 ms |
5228 KB |
Output is correct |
7 |
Correct |
281 ms |
30700 KB |
Output is correct |
8 |
Correct |
3 ms |
4716 KB |
Output is correct |
9 |
Correct |
3 ms |
4716 KB |
Output is correct |
10 |
Correct |
3 ms |
4716 KB |
Output is correct |
11 |
Correct |
4 ms |
4716 KB |
Output is correct |
12 |
Correct |
15 ms |
5228 KB |
Output is correct |
13 |
Correct |
250 ms |
26220 KB |
Output is correct |
14 |
Correct |
3 ms |
4716 KB |
Output is correct |
15 |
Correct |
3 ms |
4716 KB |
Output is correct |
16 |
Correct |
8 ms |
5228 KB |
Output is correct |
17 |
Correct |
120 ms |
19308 KB |
Output is correct |
18 |
Correct |
3 ms |
4716 KB |
Output is correct |
19 |
Correct |
3 ms |
4716 KB |
Output is correct |
20 |
Correct |
65 ms |
8272 KB |
Output is correct |
21 |
Correct |
254 ms |
26988 KB |
Output is correct |
22 |
Correct |
256 ms |
26476 KB |
Output is correct |
23 |
Correct |
262 ms |
28396 KB |
Output is correct |
24 |
Correct |
249 ms |
26348 KB |
Output is correct |
25 |
Correct |
107 ms |
16892 KB |
Output is correct |
26 |
Correct |
105 ms |
16620 KB |
Output is correct |
27 |
Correct |
266 ms |
29548 KB |
Output is correct |
28 |
Correct |
246 ms |
26220 KB |
Output is correct |
29 |
Correct |
3 ms |
4716 KB |
Output is correct |
30 |
Correct |
3 ms |
4716 KB |
Output is correct |
31 |
Correct |
3 ms |
4716 KB |
Output is correct |
32 |
Correct |
3 ms |
4716 KB |
Output is correct |
33 |
Correct |
3 ms |
4716 KB |
Output is correct |
34 |
Correct |
3 ms |
4716 KB |
Output is correct |
35 |
Correct |
3 ms |
4716 KB |
Output is correct |
36 |
Correct |
13 ms |
5228 KB |
Output is correct |
37 |
Correct |
265 ms |
26348 KB |
Output is correct |
38 |
Correct |
3 ms |
4716 KB |
Output is correct |
39 |
Correct |
3 ms |
4716 KB |
Output is correct |
40 |
Correct |
13 ms |
5228 KB |
Output is correct |
41 |
Correct |
263 ms |
30444 KB |
Output is correct |
42 |
Correct |
4 ms |
4716 KB |
Output is correct |
43 |
Correct |
4 ms |
4716 KB |
Output is correct |
44 |
Correct |
8 ms |
5228 KB |
Output is correct |
45 |
Correct |
119 ms |
19180 KB |
Output is correct |
46 |
Correct |
3 ms |
4716 KB |
Output is correct |
47 |
Correct |
3 ms |
4716 KB |
Output is correct |
48 |
Correct |
3 ms |
4716 KB |
Output is correct |
49 |
Correct |
66 ms |
8300 KB |
Output is correct |
50 |
Correct |
255 ms |
26988 KB |
Output is correct |
51 |
Correct |
256 ms |
26348 KB |
Output is correct |
52 |
Correct |
261 ms |
29420 KB |
Output is correct |
53 |
Correct |
105 ms |
16492 KB |
Output is correct |
54 |
Correct |
111 ms |
16876 KB |
Output is correct |
55 |
Correct |
251 ms |
26476 KB |
Output is correct |
56 |
Correct |
263 ms |
28396 KB |
Output is correct |
57 |
Correct |
108 ms |
16492 KB |
Output is correct |
58 |
Correct |
3 ms |
4716 KB |
Output is correct |
59 |
Correct |
3 ms |
4716 KB |
Output is correct |
60 |
Correct |
3 ms |
4716 KB |
Output is correct |
61 |
Correct |
68 ms |
8172 KB |
Output is correct |
62 |
Correct |
261 ms |
26860 KB |
Output is correct |
63 |
Correct |
258 ms |
26364 KB |
Output is correct |
64 |
Correct |
266 ms |
28396 KB |
Output is correct |
65 |
Correct |
3 ms |
4716 KB |
Output is correct |
66 |
Correct |
64 ms |
8172 KB |
Output is correct |
67 |
Correct |
250 ms |
26860 KB |
Output is correct |
68 |
Correct |
254 ms |
26424 KB |
Output is correct |
69 |
Correct |
267 ms |
29420 KB |
Output is correct |
70 |
Correct |
3 ms |
4716 KB |
Output is correct |
71 |
Correct |
3 ms |
4716 KB |
Output is correct |
72 |
Incorrect |
3 ms |
4716 KB |
Too few ways to get from 0 to 1, should be 2 found 1 |
73 |
Halted |
0 ms |
0 KB |
- |