oj.uz

Submission #519916

# Submission time Handle Problem Language Result Execution time Memory
519916 2022-01-27T16:20:59 Z LucaIlie Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 189 ms 22408 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, 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] == 3 )
                return 0;
            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;
                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:71:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |             for ( i = 0; i < v.size(); i++ ) {
      |                          ~~^~~~~~~~~~
supertrees.cpp:72:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |                 for ( j = i + 1; j < v.size(); j++ ) {
      |                                  ~~^~~~~~~~~~
supertrees.cpp:84:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |                 for ( i = 0; i < v.size(); i++ ) {
      |                              ~~^~~~~~~~~~
supertrees.cpp:102:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |                 for ( i = 0; i < v.size(); i++ ) {
      |                              ~~^~~~~~~~~~
supertrees.cpp:103:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |                     for ( j = i + 1; j < v.size(); j++ ) {
      |                                      ~~^~~~~~~~~~
supertrees.cpp:114:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |                 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 1 ms 332 KB Output is correct
6 Correct 11 ms 1228 KB Output is correct
7 Correct 179 ms 22136 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 1 ms 332 KB Output is correct
6 Correct 11 ms 1228 KB Output is correct
7 Correct 179 ms 22136 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 7 ms 1228 KB Output is correct
13 Correct 168 ms 22212 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 92 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 43 ms 5808 KB Output is correct
21 Correct 177 ms 22152 KB Output is correct
22 Correct 166 ms 22212 KB Output is correct
23 Correct 189 ms 22140 KB Output is correct
24 Correct 171 ms 22140 KB Output is correct
25 Correct 77 ms 12168 KB Output is correct
26 Correct 75 ms 12356 KB Output is correct
27 Correct 188 ms 22136 KB Output is correct
28 Correct 169 ms 22148 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 9 ms 1268 KB Output is correct
9 Correct 172 ms 22164 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 8 ms 1228 KB Output is correct
13 Correct 181 ms 22140 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 844 KB Output is correct
17 Correct 88 ms 12280 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 46 ms 5764 KB Output is correct
22 Correct 169 ms 22152 KB Output is correct
23 Correct 170 ms 22152 KB Output is correct
24 Correct 182 ms 22140 KB Output is correct
25 Correct 74 ms 12296 KB Output is correct
26 Correct 80 ms 12228 KB Output is correct
27 Correct 176 ms 22408 KB Output is correct
28 Correct 180 ms 22136 KB Output is correct
29 Correct 73 ms 12228 KB Output is correct

Subtask #4
35.0 / 35.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 57 ms 5768 KB Output is correct
5 Correct 171 ms 22148 KB Output is correct
6 Correct 172 ms 22212 KB Output is correct
7 Correct 183 ms 22140 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 43 ms 5756 KB Output is correct
10 Correct 179 ms 22148 KB Output is correct
11 Correct 170 ms 22212 KB Output is correct
12 Correct 182 ms 22340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 44 ms 5764 KB Output is correct
17 Correct 170 ms 22212 KB Output is correct
18 Correct 172 ms 22120 KB Output is correct
19 Correct 177 ms 22200 KB Output is correct
20 Correct 174 ms 22276 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 1 ms 332 KB Output is correct
6 Correct 11 ms 1228 KB Output is correct
7 Correct 179 ms 22136 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 7 ms 1228 KB Output is correct
13 Correct 168 ms 22212 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 92 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 43 ms 5808 KB Output is correct
21 Correct 177 ms 22152 KB Output is correct
22 Correct 166 ms 22212 KB Output is correct
23 Correct 189 ms 22140 KB Output is correct
24 Correct 171 ms 22140 KB Output is correct
25 Correct 77 ms 12168 KB Output is correct
26 Correct 75 ms 12356 KB Output is correct
27 Correct 188 ms 22136 KB Output is correct
28 Correct 169 ms 22148 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 9 ms 1268 KB Output is correct
37 Correct 172 ms 22164 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 8 ms 1228 KB Output is correct
41 Correct 181 ms 22140 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 844 KB Output is correct
45 Correct 88 ms 12280 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 46 ms 5764 KB Output is correct
50 Correct 169 ms 22152 KB Output is correct
51 Correct 170 ms 22152 KB Output is correct
52 Correct 182 ms 22140 KB Output is correct
53 Correct 74 ms 12296 KB Output is correct
54 Correct 80 ms 12228 KB Output is correct
55 Correct 176 ms 22408 KB Output is correct
56 Correct 180 ms 22136 KB Output is correct
57 Correct 73 ms 12228 KB Output is correct
58 Correct 0 ms 332 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 5 ms 844 KB Output is correct
61 Correct 92 ms 12284 KB Output is correct
62 Correct 0 ms 332 KB Output is correct
63 Correct 0 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 46 ms 5804 KB Output is correct
66 Correct 77 ms 12280 KB Output is correct
67 Correct 75 ms 12228 KB Output is correct
68 Correct 75 ms 12228 KB Output is correct
69 Correct 74 ms 12280 KB Output is correct

Subtask #6
4.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 1 ms 332 KB Output is correct
6 Correct 11 ms 1228 KB Output is correct
7 Correct 179 ms 22136 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 7 ms 1228 KB Output is correct
13 Correct 168 ms 22212 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 5 ms 844 KB Output is correct
17 Correct 92 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 43 ms 5808 KB Output is correct
21 Correct 177 ms 22152 KB Output is correct
22 Correct 166 ms 22212 KB Output is correct
23 Correct 189 ms 22140 KB Output is correct
24 Correct 171 ms 22140 KB Output is correct
25 Correct 77 ms 12168 KB Output is correct
26 Correct 75 ms 12356 KB Output is correct
27 Correct 188 ms 22136 KB Output is correct
28 Correct 169 ms 22148 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 9 ms 1268 KB Output is correct
37 Correct 172 ms 22164 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 8 ms 1228 KB Output is correct
41 Correct 181 ms 22140 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 844 KB Output is correct
45 Correct 88 ms 12280 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 46 ms 5764 KB Output is correct
50 Correct 169 ms 22152 KB Output is correct
51 Correct 170 ms 22152 KB Output is correct
52 Correct 182 ms 22140 KB Output is correct
53 Correct 74 ms 12296 KB Output is correct
54 Correct 80 ms 12228 KB Output is correct
55 Correct 176 ms 22408 KB Output is correct
56 Correct 180 ms 22136 KB Output is correct
57 Correct 73 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 0 ms 332 KB Output is correct
61 Correct 57 ms 5768 KB Output is correct
62 Correct 171 ms 22148 KB Output is correct
63 Correct 172 ms 22212 KB Output is correct
64 Correct 183 ms 22140 KB Output is correct
65 Correct 1 ms 332 KB Output is correct
66 Correct 43 ms 5756 KB Output is correct
67 Correct 179 ms 22148 KB Output is correct
68 Correct 170 ms 22212 KB Output is correct
69 Correct 182 ms 22340 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 1 ms 332 KB Output is correct
72 Correct 0 ms 332 KB Output is correct
73 Correct 44 ms 5764 KB Output is correct
74 Correct 170 ms 22212 KB Output is correct
75 Correct 172 ms 22120 KB Output is correct
76 Correct 177 ms 22200 KB Output is correct
77 Correct 174 ms 22276 KB Output is correct
78 Correct 0 ms 332 KB Output is correct
79 Correct 1 ms 332 KB Output is correct
80 Correct 5 ms 844 KB Output is correct
81 Correct 92 ms 12284 KB Output is correct
82 Correct 0 ms 332 KB Output is correct
83 Correct 0 ms 332 KB Output is correct
84 Correct 1 ms 332 KB Output is correct
85 Correct 46 ms 5804 KB Output is correct
86 Correct 77 ms 12280 KB Output is correct
87 Correct 75 ms 12228 KB Output is correct
88 Correct 75 ms 12228 KB Output is correct
89 Correct 74 ms 12280 KB Output is correct
90 Correct 1 ms 332 KB Output is correct
91 Correct 0 ms 332 KB Output is correct
92 Correct 4 ms 588 KB Output is correct
93 Correct 76 ms 8200 KB Output is correct
94 Correct 1 ms 332 KB Output is correct
95 Correct 1 ms 332 KB Output is correct
96 Correct 1 ms 332 KB Output is correct
97 Correct 17 ms 2252 KB Output is correct
98 Correct 69 ms 8132 KB Output is correct
99 Correct 79 ms 8188 KB Output is correct
100 Correct 72 ms 8204 KB Output is correct
101 Correct 68 ms 8204 KB Output is correct
102 Correct 67 ms 10084 KB Output is correct
103 Correct 72 ms 10088 KB Output is correct
104 Correct 69 ms 10088 KB Output is correct
105 Correct 75 ms 10180 KB Output is correct