#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int ota[222222], bobo[222222];
int find(int x)
{
return (ota[x] == x ? x : ota[x] = find(ota[x]));
}
void unite(int x, int y)
{
x = find(x);
y = find(y);
ota[y] = x;
}
int find2(int x)
{
return (bobo[x] == x ? x : bobo[x] = find2(bobo[x]));
}
vector<int> v[222222];
void unite2(int x, int y)
{
x = find2(x);
y = find2(y);
bobo[y] = x;
}
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
std::vector<std::vector<int>> a;
for (int i = 0; i < n; i++) {
std::vector<int> row;
row.resize(n);
a.push_back(row);
}
for(int i = 0; i < n; i ++)
ota[i] = i;
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j ++)
{
if(p[i][j] == 1)
{
unite(i, j);
}
}
}
for(int i = 0; i < n; i ++)
bobo[i] = ota[i];
for(int i = 0; i < n; i ++)
{
for(int j = 0; j < n; j ++)
{
int foo = find(i), hoo = find(j);
if(p[i][j] == 2)
{
unite2(foo, hoo);
}
}
}
for(int i = 0; i < n; i ++)
for(int j = 0; j < n; j ++)
{
if(p[i][j] == 3)
return 0;
int boboi = find2(i), boboj = find2(j);
int otai = find(i), otaj = find(j);
if(otai == otaj)
{
if(p[i][j] != 1)
return 0;
}
if(otai != otaj)
{
if(boboi == boboj)
{
if(p[i][j] != 2)
return 0;
}
else{
if(p[i][j] != 0)
return 0;
}
}
//if(boboi != boboj && p[i][j] != 2)
// return 0;
if(otai == otaj)
{
if(otai != i)
a[i][otai] = a[otai][i] = 1;
}
}
vector<int> dead(n + 1, 0);
set<int> s;
for(int i = 0; i < n; i ++)
{
int o = find(i);
if(dead[o])
continue;
dead[o] = 1;
v[bobo[o]].push_back(o);
}
for(int i = 0; i <= n; i ++)
{
vector<int> it = v[i];
if(it.size()==2)
return 0;
//for(auto id : it)
//cerr << id << ' ';
//cerr << '\n';
for(int j = 1; j < it.size(); j ++)
{
a[it[j]][it[j-1]] = a[it[j-1]][it[j]] = 1;
}
}
build(a);
return 1;
}
/*
5
1 0 0 1 1
0 1 1 0 0
0 1 1 0 0
1 0 0 1 1
1 0 0 1 1
*/
Compilation message
supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:117:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
117 | for(int j = 1; j < it.size(); j ++)
| ~~^~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
5504 KB |
Output is correct |
2 |
Correct |
4 ms |
5632 KB |
Output is correct |
3 |
Correct |
4 ms |
5504 KB |
Output is correct |
4 |
Correct |
4 ms |
5608 KB |
Output is correct |
5 |
Correct |
4 ms |
5504 KB |
Output is correct |
6 |
Correct |
15 ms |
6400 KB |
Output is correct |
7 |
Correct |
278 ms |
27384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
5504 KB |
Output is correct |
2 |
Correct |
4 ms |
5632 KB |
Output is correct |
3 |
Correct |
4 ms |
5504 KB |
Output is correct |
4 |
Correct |
4 ms |
5608 KB |
Output is correct |
5 |
Correct |
4 ms |
5504 KB |
Output is correct |
6 |
Correct |
15 ms |
6400 KB |
Output is correct |
7 |
Correct |
278 ms |
27384 KB |
Output is correct |
8 |
Correct |
4 ms |
5504 KB |
Output is correct |
9 |
Correct |
4 ms |
5504 KB |
Output is correct |
10 |
Correct |
4 ms |
5504 KB |
Output is correct |
11 |
Correct |
4 ms |
5504 KB |
Output is correct |
12 |
Correct |
14 ms |
6400 KB |
Output is correct |
13 |
Correct |
252 ms |
27332 KB |
Output is correct |
14 |
Correct |
4 ms |
5504 KB |
Output is correct |
15 |
Correct |
4 ms |
5504 KB |
Output is correct |
16 |
Correct |
9 ms |
6016 KB |
Output is correct |
17 |
Correct |
131 ms |
17400 KB |
Output is correct |
18 |
Correct |
4 ms |
5524 KB |
Output is correct |
19 |
Correct |
4 ms |
5504 KB |
Output is correct |
20 |
Correct |
71 ms |
11000 KB |
Output is correct |
21 |
Correct |
280 ms |
27384 KB |
Output is correct |
22 |
Correct |
258 ms |
27384 KB |
Output is correct |
23 |
Correct |
284 ms |
27384 KB |
Output is correct |
24 |
Correct |
247 ms |
27364 KB |
Output is correct |
25 |
Correct |
112 ms |
17400 KB |
Output is correct |
26 |
Correct |
113 ms |
17344 KB |
Output is correct |
27 |
Correct |
285 ms |
27384 KB |
Output is correct |
28 |
Correct |
249 ms |
27488 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
5504 KB |
Output is correct |
2 |
Correct |
4 ms |
5504 KB |
Output is correct |
3 |
Correct |
4 ms |
5504 KB |
Output is correct |
4 |
Correct |
4 ms |
5504 KB |
Output is correct |
5 |
Incorrect |
4 ms |
5504 KB |
Too few ways to get from 0 to 1, should be 2 found 1 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
5504 KB |
Output is correct |
2 |
Incorrect |
4 ms |
5504 KB |
Too few ways to get from 0 to 1, should be 2 found 1 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
5504 KB |
Output is correct |
2 |
Correct |
4 ms |
5632 KB |
Output is correct |
3 |
Correct |
4 ms |
5504 KB |
Output is correct |
4 |
Correct |
4 ms |
5608 KB |
Output is correct |
5 |
Correct |
4 ms |
5504 KB |
Output is correct |
6 |
Correct |
15 ms |
6400 KB |
Output is correct |
7 |
Correct |
278 ms |
27384 KB |
Output is correct |
8 |
Correct |
4 ms |
5504 KB |
Output is correct |
9 |
Correct |
4 ms |
5504 KB |
Output is correct |
10 |
Correct |
4 ms |
5504 KB |
Output is correct |
11 |
Correct |
4 ms |
5504 KB |
Output is correct |
12 |
Correct |
14 ms |
6400 KB |
Output is correct |
13 |
Correct |
252 ms |
27332 KB |
Output is correct |
14 |
Correct |
4 ms |
5504 KB |
Output is correct |
15 |
Correct |
4 ms |
5504 KB |
Output is correct |
16 |
Correct |
9 ms |
6016 KB |
Output is correct |
17 |
Correct |
131 ms |
17400 KB |
Output is correct |
18 |
Correct |
4 ms |
5524 KB |
Output is correct |
19 |
Correct |
4 ms |
5504 KB |
Output is correct |
20 |
Correct |
71 ms |
11000 KB |
Output is correct |
21 |
Correct |
280 ms |
27384 KB |
Output is correct |
22 |
Correct |
258 ms |
27384 KB |
Output is correct |
23 |
Correct |
284 ms |
27384 KB |
Output is correct |
24 |
Correct |
247 ms |
27364 KB |
Output is correct |
25 |
Correct |
112 ms |
17400 KB |
Output is correct |
26 |
Correct |
113 ms |
17344 KB |
Output is correct |
27 |
Correct |
285 ms |
27384 KB |
Output is correct |
28 |
Correct |
249 ms |
27488 KB |
Output is correct |
29 |
Correct |
4 ms |
5504 KB |
Output is correct |
30 |
Correct |
4 ms |
5504 KB |
Output is correct |
31 |
Correct |
4 ms |
5504 KB |
Output is correct |
32 |
Correct |
4 ms |
5504 KB |
Output is correct |
33 |
Incorrect |
4 ms |
5504 KB |
Too few ways to get from 0 to 1, should be 2 found 1 |
34 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
5504 KB |
Output is correct |
2 |
Correct |
4 ms |
5632 KB |
Output is correct |
3 |
Correct |
4 ms |
5504 KB |
Output is correct |
4 |
Correct |
4 ms |
5608 KB |
Output is correct |
5 |
Correct |
4 ms |
5504 KB |
Output is correct |
6 |
Correct |
15 ms |
6400 KB |
Output is correct |
7 |
Correct |
278 ms |
27384 KB |
Output is correct |
8 |
Correct |
4 ms |
5504 KB |
Output is correct |
9 |
Correct |
4 ms |
5504 KB |
Output is correct |
10 |
Correct |
4 ms |
5504 KB |
Output is correct |
11 |
Correct |
4 ms |
5504 KB |
Output is correct |
12 |
Correct |
14 ms |
6400 KB |
Output is correct |
13 |
Correct |
252 ms |
27332 KB |
Output is correct |
14 |
Correct |
4 ms |
5504 KB |
Output is correct |
15 |
Correct |
4 ms |
5504 KB |
Output is correct |
16 |
Correct |
9 ms |
6016 KB |
Output is correct |
17 |
Correct |
131 ms |
17400 KB |
Output is correct |
18 |
Correct |
4 ms |
5524 KB |
Output is correct |
19 |
Correct |
4 ms |
5504 KB |
Output is correct |
20 |
Correct |
71 ms |
11000 KB |
Output is correct |
21 |
Correct |
280 ms |
27384 KB |
Output is correct |
22 |
Correct |
258 ms |
27384 KB |
Output is correct |
23 |
Correct |
284 ms |
27384 KB |
Output is correct |
24 |
Correct |
247 ms |
27364 KB |
Output is correct |
25 |
Correct |
112 ms |
17400 KB |
Output is correct |
26 |
Correct |
113 ms |
17344 KB |
Output is correct |
27 |
Correct |
285 ms |
27384 KB |
Output is correct |
28 |
Correct |
249 ms |
27488 KB |
Output is correct |
29 |
Correct |
4 ms |
5504 KB |
Output is correct |
30 |
Correct |
4 ms |
5504 KB |
Output is correct |
31 |
Correct |
4 ms |
5504 KB |
Output is correct |
32 |
Correct |
4 ms |
5504 KB |
Output is correct |
33 |
Incorrect |
4 ms |
5504 KB |
Too few ways to get from 0 to 1, should be 2 found 1 |
34 |
Halted |
0 ms |
0 KB |
- |