oj.uz

Submission #519567

# Submission time Handle Problem Language Result Execution time Memory
519567 2022-01-26T16:58:40 Z LucaIlie Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 209 ms 23200 KB 
#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;
            }
        }
    }

    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++ ) {
      |                          ~~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 8 ms 1332 KB Output is correct
7 Correct 189 ms 23004 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 8 ms 1332 KB Output is correct
7 Correct 189 ms 23004 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 7 ms 1308 KB Output is correct
13 Correct 170 ms 23052 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 836 KB Output is correct
17 Correct 95 ms 12828 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 288 KB Output is correct
20 Correct 44 ms 6264 KB Output is correct
21 Correct 174 ms 23008 KB Output is correct
22 Correct 173 ms 22944 KB Output is correct
23 Correct 193 ms 23140 KB Output is correct
24 Correct 184 ms 23200 KB Output is correct
25 Correct 80 ms 12872 KB Output is correct
26 Correct 81 ms 12860 KB Output is correct
27 Correct 209 ms 23012 KB Output is correct
28 Correct 173 ms 23096 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 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 -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 52 ms 6232 KB Output is correct
5 Correct 184 ms 22996 KB Output is correct
6 Correct 195 ms 22984 KB Output is correct
7 Correct 187 ms 23000 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 43 ms 6232 KB Output is correct
10 Correct 180 ms 23072 KB Output is correct
11 Correct 190 ms 23068 KB Output is correct
12 Correct 183 ms 23000 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Incorrect 19 ms 3812 KB Answer gives possible 0 while actual possible 1
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 8 ms 1332 KB Output is correct
7 Correct 189 ms 23004 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 7 ms 1308 KB Output is correct
13 Correct 170 ms 23052 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 836 KB Output is correct
17 Correct 95 ms 12828 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 288 KB Output is correct
20 Correct 44 ms 6264 KB Output is correct
21 Correct 174 ms 23008 KB Output is correct
22 Correct 173 ms 22944 KB Output is correct
23 Correct 193 ms 23140 KB Output is correct
24 Correct 184 ms 23200 KB Output is correct
25 Correct 80 ms 12872 KB Output is correct
26 Correct 81 ms 12860 KB Output is correct
27 Correct 209 ms 23012 KB Output is correct
28 Correct 173 ms 23096 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Incorrect 0 ms 332 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 8 ms 1332 KB Output is correct
7 Correct 189 ms 23004 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 7 ms 1308 KB Output is correct
13 Correct 170 ms 23052 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 836 KB Output is correct
17 Correct 95 ms 12828 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 288 KB Output is correct
20 Correct 44 ms 6264 KB Output is correct
21 Correct 174 ms 23008 KB Output is correct
22 Correct 173 ms 22944 KB Output is correct
23 Correct 193 ms 23140 KB Output is correct
24 Correct 184 ms 23200 KB Output is correct
25 Correct 80 ms 12872 KB Output is correct
26 Correct 81 ms 12860 KB Output is correct
27 Correct 209 ms 23012 KB Output is correct
28 Correct 173 ms 23096 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Incorrect 0 ms 332 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -