oj.uz

Submission #519915

# Submission time Handle Problem Language Result Execution time Memory
519915 2022-01-27T16:18:49 Z LucaIlie Connecting Supertrees (IOI20_supertrees) C++17
96 / 100
 233 ms 24128 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, e2;
    dsu forest1, forest2;
    vector <int> f1[MAX_N], f2[MAX_N];

    n = p.size();
    vector <int> v;
    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++ ) {
        v = f1[x];
        if ( v.size() > 1 ) {
            e2 = 0;
            for ( i = 0; i < v.size(); i++ ) {
                for ( j = i + 1; j < v.size(); j++ ) {
                    if ( p[v[i]][v[j]] == 0 )
                        return 0;
                    if ( p[v[i]][v[j]] == 2 )
                        e2 = 1;
                }
            }
            if ( e2 ) {
                if ( v.size() == 2 )
                    return 0;
                sef1 = sef2 = -1;
                for ( i = 0; i < v.size(); i++ ) {
                    if ( forest2.find( v[i] ) != v[i] && forest2.find( v[i] ) != sef1 && forest2.find( v[i] ) != sef2 ) {
                        if ( sef1 == -1 )
                            sef1 = forest2.find( v[i] );
                        else if ( sef2 == -1 )
                            sef2 = forest2.find( v[i] );
                        //else
                            //return 0;
                    }
                }
                first = -1;
                last = -1;
                for ( i = 0; i < v.size(); i++ ) {
                    if ( forest2.find( v[i] ) != v[i] ) {
                        b[v[i]][forest2.find( v[i] )] = 1;
                        b[forest2.find( v[i] )][v[i]] = 1;
                    } else {
                        if ( last != -1 ) {
                            b[last][v[i]] = 1;
                            b[v[i]][last] = 1;
                        }
                        if ( first == -1 )
                            first = v[i];
                        last = v[i];
                    }
                }
                if ( first != last ) {
                    b[first][last] = 1;
                    b[last][first] = 1;
                }
                for ( i = 0; i < v.size(); i++ ) {
                    for ( j = i + 1; j < v.size(); j++ ) {
                        if ( forest2.find( v[i] ) == forest2.find( v[j] ) ) {
                            if ( p[v[i]][v[j]] != 1 )
                                return 0;
                        } else {
                            if ( p[v[i]][v[j]] != 2 )
                                return 0;
                        }
                    }
                }
            } else {
                for ( i = 0; i < v.size() - 1; i++ ) {
                    b[v[i]][v[i + 1]] = 1;
                    b[v[i + 1]][v[i]] = 1;
                }
            }
        }
    }

    build( b );

    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:69:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |             for ( i = 0; i < v.size(); i++ ) {
      |                          ~~^~~~~~~~~~
supertrees.cpp:70:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |                 for ( j = i + 1; j < v.size(); j++ ) {
      |                                  ~~^~~~~~~~~~
supertrees.cpp:81:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |                 for ( i = 0; i < v.size(); i++ ) {
      |                              ~~^~~~~~~~~~
supertrees.cpp:93:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |                 for ( i = 0; i < v.size(); i++ ) {
      |                              ~~^~~~~~~~~~
supertrees.cpp:111:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |                 for ( i = 0; i < v.size(); i++ ) {
      |                              ~~^~~~~~~~~~
supertrees.cpp:112:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |                     for ( j = i + 1; j < v.size(); j++ ) {
      |                                      ~~^~~~~~~~~~
supertrees.cpp:123:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |                 for ( i = 0; i < v.size() - 1; i++ ) {
      |                              ~~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 7 ms 1228 KB Output is correct
7 Correct 192 ms 22144 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 0 ms 332 KB Output is correct
3 Correct 0 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 7 ms 1228 KB Output is correct
7 Correct 192 ms 22144 KB Output is correct
8 Correct 0 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 0 ms 332 KB Output is correct
12 Correct 8 ms 1228 KB Output is correct
13 Correct 233 ms 22212 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 844 KB Output is correct
17 Correct 91 ms 12300 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 46 ms 5824 KB Output is correct
21 Correct 177 ms 22212 KB Output is correct
22 Correct 184 ms 22288 KB Output is correct
23 Correct 202 ms 22168 KB Output is correct
24 Correct 186 ms 22248 KB Output is correct
25 Correct 82 ms 12284 KB Output is correct
26 Correct 86 ms 12284 KB Output is correct
27 Correct 196 ms 22280 KB Output is correct
28 Correct 183 ms 22156 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 8 ms 1216 KB Output is correct
9 Correct 182 ms 22140 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 9 ms 1280 KB Output is correct
13 Correct 186 ms 22144 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 4 ms 824 KB Output is correct
17 Correct 90 ms 12284 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 48 ms 5796 KB Output is correct
22 Correct 178 ms 22188 KB Output is correct
23 Correct 197 ms 22212 KB Output is correct
24 Correct 204 ms 22136 KB Output is correct
25 Correct 93 ms 12288 KB Output is correct
26 Correct 79 ms 12288 KB Output is correct
27 Correct 173 ms 22228 KB Output is correct
28 Correct 214 ms 22216 KB Output is correct
29 Correct 80 ms 12228 KB Output is correct

Subtask #4
35.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 1 ms 332 KB Output is correct
4 Correct 46 ms 5760 KB Output is correct
5 Correct 185 ms 22140 KB Output is correct
6 Correct 182 ms 22212 KB Output is correct
7 Correct 188 ms 22084 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 46 ms 5832 KB Output is correct
10 Correct 181 ms 22168 KB Output is correct
11 Correct 231 ms 22196 KB Output is correct
12 Correct 192 ms 22144 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 48 ms 5744 KB Output is correct
17 Correct 203 ms 23316 KB Output is correct
18 Correct 187 ms 23284 KB Output is correct
19 Correct 184 ms 23268 KB Output is correct
20 Correct 184 ms 23320 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 7 ms 1228 KB Output is correct
7 Correct 192 ms 22144 KB Output is correct
8 Correct 0 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 0 ms 332 KB Output is correct
12 Correct 8 ms 1228 KB Output is correct
13 Correct 233 ms 22212 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 844 KB Output is correct
17 Correct 91 ms 12300 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 46 ms 5824 KB Output is correct
21 Correct 177 ms 22212 KB Output is correct
22 Correct 184 ms 22288 KB Output is correct
23 Correct 202 ms 22168 KB Output is correct
24 Correct 186 ms 22248 KB Output is correct
25 Correct 82 ms 12284 KB Output is correct
26 Correct 86 ms 12284 KB Output is correct
27 Correct 196 ms 22280 KB Output is correct
28 Correct 183 ms 22156 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 8 ms 1216 KB Output is correct
37 Correct 182 ms 22140 KB Output is correct
38 Correct 0 ms 332 KB Output is correct
39 Correct 0 ms 332 KB Output is correct
40 Correct 9 ms 1280 KB Output is correct
41 Correct 186 ms 22144 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 4 ms 824 KB Output is correct
45 Correct 90 ms 12284 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 0 ms 332 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 48 ms 5796 KB Output is correct
50 Correct 178 ms 22188 KB Output is correct
51 Correct 197 ms 22212 KB Output is correct
52 Correct 204 ms 22136 KB Output is correct
53 Correct 93 ms 12288 KB Output is correct
54 Correct 79 ms 12288 KB Output is correct
55 Correct 173 ms 22228 KB Output is correct
56 Correct 214 ms 22216 KB Output is correct
57 Correct 80 ms 12228 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 0 ms 332 KB Output is correct
60 Correct 4 ms 844 KB Output is correct
61 Correct 125 ms 12284 KB Output is correct
62 Correct 0 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 0 ms 332 KB Output is correct
65 Correct 62 ms 5752 KB Output is correct
66 Correct 76 ms 14248 KB Output is correct
67 Correct 112 ms 14188 KB Output is correct
68 Correct 73 ms 14196 KB Output is correct
69 Correct 76 ms 14184 KB Output is correct

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 7 ms 1228 KB Output is correct
7 Correct 192 ms 22144 KB Output is correct
8 Correct 0 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 0 ms 332 KB Output is correct
12 Correct 8 ms 1228 KB Output is correct
13 Correct 233 ms 22212 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 844 KB Output is correct
17 Correct 91 ms 12300 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 46 ms 5824 KB Output is correct
21 Correct 177 ms 22212 KB Output is correct
22 Correct 184 ms 22288 KB Output is correct
23 Correct 202 ms 22168 KB Output is correct
24 Correct 186 ms 22248 KB Output is correct
25 Correct 82 ms 12284 KB Output is correct
26 Correct 86 ms 12284 KB Output is correct
27 Correct 196 ms 22280 KB Output is correct
28 Correct 183 ms 22156 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 8 ms 1216 KB Output is correct
37 Correct 182 ms 22140 KB Output is correct
38 Correct 0 ms 332 KB Output is correct
39 Correct 0 ms 332 KB Output is correct
40 Correct 9 ms 1280 KB Output is correct
41 Correct 186 ms 22144 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 4 ms 824 KB Output is correct
45 Correct 90 ms 12284 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 0 ms 332 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 48 ms 5796 KB Output is correct
50 Correct 178 ms 22188 KB Output is correct
51 Correct 197 ms 22212 KB Output is correct
52 Correct 204 ms 22136 KB Output is correct
53 Correct 93 ms 12288 KB Output is correct
54 Correct 79 ms 12288 KB Output is correct
55 Correct 173 ms 22228 KB Output is correct
56 Correct 214 ms 22216 KB Output is correct
57 Correct 80 ms 12228 KB Output is correct
58 Correct 0 ms 332 KB Output is correct
59 Correct 0 ms 332 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 46 ms 5760 KB Output is correct
62 Correct 185 ms 22140 KB Output is correct
63 Correct 182 ms 22212 KB Output is correct
64 Correct 188 ms 22084 KB Output is correct
65 Correct 1 ms 332 KB Output is correct
66 Correct 46 ms 5832 KB Output is correct
67 Correct 181 ms 22168 KB Output is correct
68 Correct 231 ms 22196 KB Output is correct
69 Correct 192 ms 22144 KB Output is correct
70 Correct 0 ms 332 KB Output is correct
71 Correct 0 ms 332 KB Output is correct
72 Correct 1 ms 460 KB Output is correct
73 Correct 48 ms 5744 KB Output is correct
74 Correct 203 ms 23316 KB Output is correct
75 Correct 187 ms 23284 KB Output is correct
76 Correct 184 ms 23268 KB Output is correct
77 Correct 184 ms 23320 KB Output is correct
78 Correct 1 ms 332 KB Output is correct
79 Correct 0 ms 332 KB Output is correct
80 Correct 4 ms 844 KB Output is correct
81 Correct 125 ms 12284 KB Output is correct
82 Correct 0 ms 332 KB Output is correct
83 Correct 1 ms 332 KB Output is correct
84 Correct 0 ms 332 KB Output is correct
85 Correct 62 ms 5752 KB Output is correct
86 Correct 76 ms 14248 KB Output is correct
87 Correct 112 ms 14188 KB Output is correct
88 Correct 73 ms 14196 KB Output is correct
89 Correct 76 ms 14184 KB Output is correct
90 Correct 1 ms 296 KB Output is correct
91 Correct 1 ms 332 KB Output is correct
92 Correct 5 ms 844 KB Output is correct
93 Correct 106 ms 14184 KB Output is correct
94 Correct 1 ms 332 KB Output is correct
95 Correct 1 ms 292 KB Output is correct
96 Correct 1 ms 332 KB Output is correct
97 Correct 20 ms 3780 KB Output is correct
98 Correct 83 ms 14188 KB Output is correct
99 Correct 81 ms 14192 KB Output is correct
100 Correct 83 ms 14152 KB Output is correct
101 Incorrect 214 ms 24128 KB Answer gives possible 1 while actual possible 0
102 Halted 0 ms 0 KB -