#include "supertrees.h"
#include <vector>
using namespace std;
int construct(std::vector<std::vector<int> > p) {
int n = p.size();
std::vector<std::vector<int> > answer;
answer.resize(n);
for(int i=0;i<n;i++) answer[i].resize(n);
int daddy[n];
for(int i=0;i<n;i++) daddy[i]=i;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
answer[i][j]=0;
}
}
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
if(p[i][j]==1 && daddy[i]!=daddy[j]){
daddy[j]=daddy[i];
answer[j][daddy[i]]=1;
answer[daddy[i]][j]=1;
}
}
}
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
if(p[i][j]==0)
{
if(daddy[i]==daddy[j]) return 0;
}
if(p[i][j]==1)
{
if(daddy[i]!=daddy[j]) return 0;
}
}
}
build(answer);
return 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
276 KB |
Output is correct |
6 |
Correct |
11 ms |
1196 KB |
Output is correct |
7 |
Correct |
230 ms |
22476 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
276 KB |
Output is correct |
6 |
Correct |
11 ms |
1196 KB |
Output is correct |
7 |
Correct |
230 ms |
22476 KB |
Output is correct |
8 |
Correct |
1 ms |
284 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
284 KB |
Output is correct |
12 |
Correct |
10 ms |
1224 KB |
Output is correct |
13 |
Correct |
247 ms |
22488 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
204 KB |
Output is correct |
16 |
Correct |
7 ms |
716 KB |
Output is correct |
17 |
Correct |
122 ms |
12636 KB |
Output is correct |
18 |
Correct |
1 ms |
204 KB |
Output is correct |
19 |
Correct |
1 ms |
204 KB |
Output is correct |
20 |
Correct |
72 ms |
5940 KB |
Output is correct |
21 |
Correct |
241 ms |
22460 KB |
Output is correct |
22 |
Correct |
237 ms |
22524 KB |
Output is correct |
23 |
Correct |
246 ms |
22604 KB |
Output is correct |
24 |
Correct |
248 ms |
22516 KB |
Output is correct |
25 |
Correct |
109 ms |
12688 KB |
Output is correct |
26 |
Correct |
120 ms |
13340 KB |
Output is correct |
27 |
Correct |
244 ms |
23236 KB |
Output is correct |
28 |
Correct |
234 ms |
23308 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Incorrect |
1 ms |
204 KB |
Answer gives possible 1 while actual possible 0 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
276 KB |
Output is correct |
2 |
Incorrect |
1 ms |
204 KB |
Too few ways to get from 0 to 1, should be 2 found 0 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
276 KB |
Output is correct |
6 |
Correct |
11 ms |
1196 KB |
Output is correct |
7 |
Correct |
230 ms |
22476 KB |
Output is correct |
8 |
Correct |
1 ms |
284 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
284 KB |
Output is correct |
12 |
Correct |
10 ms |
1224 KB |
Output is correct |
13 |
Correct |
247 ms |
22488 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
204 KB |
Output is correct |
16 |
Correct |
7 ms |
716 KB |
Output is correct |
17 |
Correct |
122 ms |
12636 KB |
Output is correct |
18 |
Correct |
1 ms |
204 KB |
Output is correct |
19 |
Correct |
1 ms |
204 KB |
Output is correct |
20 |
Correct |
72 ms |
5940 KB |
Output is correct |
21 |
Correct |
241 ms |
22460 KB |
Output is correct |
22 |
Correct |
237 ms |
22524 KB |
Output is correct |
23 |
Correct |
246 ms |
22604 KB |
Output is correct |
24 |
Correct |
248 ms |
22516 KB |
Output is correct |
25 |
Correct |
109 ms |
12688 KB |
Output is correct |
26 |
Correct |
120 ms |
13340 KB |
Output is correct |
27 |
Correct |
244 ms |
23236 KB |
Output is correct |
28 |
Correct |
234 ms |
23308 KB |
Output is correct |
29 |
Correct |
1 ms |
204 KB |
Output is correct |
30 |
Correct |
1 ms |
204 KB |
Output is correct |
31 |
Correct |
1 ms |
204 KB |
Output is correct |
32 |
Incorrect |
1 ms |
204 KB |
Answer gives possible 1 while actual possible 0 |
33 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
276 KB |
Output is correct |
6 |
Correct |
11 ms |
1196 KB |
Output is correct |
7 |
Correct |
230 ms |
22476 KB |
Output is correct |
8 |
Correct |
1 ms |
284 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
284 KB |
Output is correct |
12 |
Correct |
10 ms |
1224 KB |
Output is correct |
13 |
Correct |
247 ms |
22488 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
204 KB |
Output is correct |
16 |
Correct |
7 ms |
716 KB |
Output is correct |
17 |
Correct |
122 ms |
12636 KB |
Output is correct |
18 |
Correct |
1 ms |
204 KB |
Output is correct |
19 |
Correct |
1 ms |
204 KB |
Output is correct |
20 |
Correct |
72 ms |
5940 KB |
Output is correct |
21 |
Correct |
241 ms |
22460 KB |
Output is correct |
22 |
Correct |
237 ms |
22524 KB |
Output is correct |
23 |
Correct |
246 ms |
22604 KB |
Output is correct |
24 |
Correct |
248 ms |
22516 KB |
Output is correct |
25 |
Correct |
109 ms |
12688 KB |
Output is correct |
26 |
Correct |
120 ms |
13340 KB |
Output is correct |
27 |
Correct |
244 ms |
23236 KB |
Output is correct |
28 |
Correct |
234 ms |
23308 KB |
Output is correct |
29 |
Correct |
1 ms |
204 KB |
Output is correct |
30 |
Correct |
1 ms |
204 KB |
Output is correct |
31 |
Correct |
1 ms |
204 KB |
Output is correct |
32 |
Incorrect |
1 ms |
204 KB |
Answer gives possible 1 while actual possible 0 |
33 |
Halted |
0 ms |
0 KB |
- |