#include <iostream>
#include <vector>
#include "supertrees.h"
#define MAX_N 1000
using namespace std;
struct dsu {
int n;
int sef[MAX_N];
void init( int x ) {
int i;
n = x;
for ( i = 0; i < n; i++ )
sef[i] = i;
}
int find( int x ) {
if ( sef[x] != x )
sef[x] = find( sef[x] );
return sef[x];
}
void unionn( int x, int y ) {
x = find( x );
y = find( y );
sef[y] = x;
}
};
int construct( vector <vector <int>> p ) {
int n, x, y, i, j, first, last, sef1, sef2;
dsu forest1, forest2;
vector <int> f1[MAX_N], f2[MAX_N];
n = p.size();
vector <vector <int>> b( n );
forest1.init( n );
forest2.init( n );
for ( x = 0; x < n; x++ ) {
for ( y = 0; y < n; y++ ) {
if ( p[x][y] >= 1 )
forest1.unionn( x, y );
if ( p[x][y] == 1 )
forest2.unionn( x, y );
}
}
for ( x = 0; x < n; x++ ) {
f1[forest1.find( x )].push_back( x );
f2[forest2.find( x )].push_back( x );
}
for ( i = 0; i < n; i++ ) {
for ( j = 0; j < n; j++ )
b[i].push_back( 0 );
}
for ( x = 0; x < n; x++ ) {
if ( f1[x].size() > 1 ) {
for ( i = 0; i < f1[x].size(); i++ ) {
for ( j = i + 1; j < f1[x].size(); j++ ) {
if ( p[f1[x][i]][f1[x][j]] == 0 )
return 0;
}
}
sef1 = sef2 = -1;
for ( i = 0; i < f1[x].size(); i++ ) {
if ( forest2.find( f1[x][i] ) != f1[x][i] && forest2.find( f1[x][i] ) != sef1 && forest2.find( f1[x][i] ) != sef2 ) {
if ( sef1 == -1 )
sef1 = forest2.find( f1[x][i] );
else if ( sef2 == -1 )
sef2 = forest2.find( f1[x][i] );
else
return 0;
}
}
first = -1;
last = -1;
for ( i = 0; i < f1[x].size(); i++ ) {
if ( forest2.find( f1[x][i] ) != f1[x][i] ) {
b[f1[x][i]][forest2.find( f1[x][i] )] = 1;
b[forest2.find( f1[x][i] )][f1[x][i]] = 1;
} else {
if ( last != -1 ) {
b[last][f1[x][i]] = 1;
b[f1[x][i]][last] = 1;
}
if ( first == -1 )
first = f1[x][i];
last = f1[x][i];
}
}
if ( first != last ) {
b[first][last] = 1;
b[last][first] = 1;
} else
return 0;
}
}
build( b );
return 1;
}
Compilation message
supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:66:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
66 | for ( i = 0; i < f1[x].size(); i++ ) {
| ~~^~~~~~~~~~~~~~
supertrees.cpp:67:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
67 | for ( j = i + 1; j < f1[x].size(); j++ ) {
| ~~^~~~~~~~~~~~~~
supertrees.cpp:73:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
73 | for ( i = 0; i < f1[x].size(); i++ ) {
| ~~^~~~~~~~~~~~~~
supertrees.cpp:85:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
85 | for ( i = 0; i < f1[x].size(); i++ ) {
| ~~^~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
324 KB |
Output is correct |
2 |
Incorrect |
1 ms |
332 KB |
Answer gives possible 0 while actual possible 1 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
324 KB |
Output is correct |
2 |
Incorrect |
1 ms |
332 KB |
Answer gives possible 0 while actual possible 1 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
272 KB |
Output is correct |
2 |
Correct |
1 ms |
288 KB |
Output is correct |
3 |
Correct |
0 ms |
332 KB |
Output is correct |
4 |
Incorrect |
0 ms |
332 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 |
288 KB |
Output is correct |
2 |
Correct |
1 ms |
324 KB |
Output is correct |
3 |
Incorrect |
1 ms |
384 KB |
Answer gives possible 0 while actual possible 1 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
324 KB |
Output is correct |
2 |
Incorrect |
1 ms |
332 KB |
Answer gives possible 0 while actual possible 1 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
324 KB |
Output is correct |
2 |
Incorrect |
1 ms |
332 KB |
Answer gives possible 0 while actual possible 1 |
3 |
Halted |
0 ms |
0 KB |
- |