oj.uz

Submission #300590

# Submission time Handle Problem Language Result Execution time Memory
300590 2020-09-17T10:01:59 Z muhammad_hokimiyon Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 307 ms 26232 KB 
#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>

using namespace std;

const int maxn = 1010;

bool used[maxn];
vector < int > v[maxn],c;

void dfs( int x )
{
    if( used[x] )return;
    used[x] = true;
    c.push_back(x);
    for( auto y : v[x] ){
        dfs( y );
    }
}

int construct( vector<vector<int>> p )
{
    int n = (int)p.size();
    for( int i = 0; i < n; i++ ){
        if( p[i][i] != 1 )return 0;
        for( int j = 0; j < n; j++ ){
            if( p[i][j] == 3 || p[i][j] != p[j][i] )return 0;
            if( p[i][j] == 0 )continue;
            if( p[i][j] == 1 ){
                v[i].push_back(j);
            }
        }
    }
    vector < vector < int > > ans( n , vector < int > (n , 0) );
    vector < int > fg;
    vector < vector < int > > gr(n);
    for( int it = 0; it < n; it++ ){
        if( used[it] )continue;
        c.clear();
        dfs( it );
        fg.push_back(it);
        gr[it] = c;
        int sz = (int)c.size();
        int cnt1 = 0 , cnt2 = 0;
        vector < int > ch( n , 0 );
        for( int i = 0; i < sz; i++ ){
            ch[c[i]] = 1;
            for( int j = 0; j < sz; j++ ){
                int x = c[i] , y = c[j];
                if( p[x][y] != 1 ){
                    return 0;
                }
            }
            if( i + 1 < sz ){
                int x = c[i] , y = c[i + 1];
                ans[x][y] = ans[y][x] = 1;
            }
        }
        for( int i = 0; i < sz; i++ ){
            for( int j = 0; j < n; j++ ){
                int x = c[i] , y = j;
                if( ch[y] )continue;
                cnt1 += 1;
                if( p[x][y] == 0 )cnt2 += 1;
            }
        }
        if( cnt2 == cnt1 ){
            fg.pop_back();
        }
    }
    for( int i = 0; i < n; i++ ){
        used[i] = false;
        v[i].clear();
        for( int j = 0; j < n; j++ ){
            if( p[i][j] != 0 ){
                v[i].push_back(j);
            }
        }
    }
    for( int i = 0; i < n; i++ ){
        if( used[i] )continue;
        c.clear();
        dfs( i );
        vector < int > g;
        for( auto x : c ){
            if( !gr[x].empty() ){
                g.push_back(x);
            }
        }
        for( int j = 0; j < (int)g.size(); j++ ){
            for( auto x : gr[g[j]] ){
                for( int h = 0; h < (int)g.size(); h++ ){
                    if( j == h )continue;
                    for( auto y : gr[g[h]] ){
                        if( p[x][y] == 1 ){
                            return 0;
                        }
                    }
                }
            }
        }
        for( int j = 0; j + 1 < (int)g.size(); j++ ){
            int x = g[j] , y = g[j + 1];
            ans[x][y] = ans[y][x] = 1;
        }
        if( (int)g.size() == 2 ){
            return 0;
        }
        if( (int)g.size() > 2 ){
            int x = g[0] , y = g.back();
            ans[x][y] = ans[y][x] = 1;
        }
        int sz = (int)c.size();
        for( int j = 0; j < sz; j++ ){
            for( int h = 0; h < sz; h++ ){
                int x = c[j] , y = c[h];
                if( p[x][y] == 0 ){
                    return 0;
                }
            }
        }
    }
    build( ans );
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1408 KB Output is correct
7 Correct 307 ms 26232 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1408 KB Output is correct
7 Correct 307 ms 26232 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 14 ms 1280 KB Output is correct
13 Correct 250 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 124 ms 14712 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 61 ms 5880 KB Output is correct
21 Correct 265 ms 22772 KB Output is correct
22 Correct 242 ms 22136 KB Output is correct
23 Correct 260 ms 24184 KB Output is correct
24 Correct 247 ms 22192 KB Output is correct
25 Correct 122 ms 12780 KB Output is correct
26 Correct 106 ms 12280 KB Output is correct
27 Correct 266 ms 25228 KB Output is correct
28 Correct 246 ms 22136 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 245 ms 22136 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 416 KB Output is correct
12 Correct 11 ms 1408 KB Output is correct
13 Correct 290 ms 26232 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 128 ms 14712 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 61 ms 5880 KB Output is correct
22 Correct 246 ms 22648 KB Output is correct
23 Correct 244 ms 22268 KB Output is correct
24 Correct 286 ms 25248 KB Output is correct
25 Correct 117 ms 12328 KB Output is correct
26 Correct 111 ms 12920 KB Output is correct
27 Correct 246 ms 22264 KB Output is correct
28 Correct 266 ms 24328 KB Output is correct
29 Correct 125 ms 12280 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 62 ms 5884 KB Output is correct
5 Correct 264 ms 22640 KB Output is correct
6 Correct 243 ms 22136 KB Output is correct
7 Correct 281 ms 24176 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 62 ms 5880 KB Output is correct
10 Correct 272 ms 22648 KB Output is correct
11 Correct 248 ms 22264 KB Output is correct
12 Correct 290 ms 25208 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 63 ms 5880 KB Output is correct
17 Correct 245 ms 22768 KB Output is correct
18 Correct 251 ms 22648 KB Output is correct
19 Correct 257 ms 22384 KB Output is correct
20 Correct 241 ms 22140 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1408 KB Output is correct
7 Correct 307 ms 26232 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 14 ms 1280 KB Output is correct
13 Correct 250 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 124 ms 14712 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 61 ms 5880 KB Output is correct
21 Correct 265 ms 22772 KB Output is correct
22 Correct 242 ms 22136 KB Output is correct
23 Correct 260 ms 24184 KB Output is correct
24 Correct 247 ms 22192 KB Output is correct
25 Correct 122 ms 12780 KB Output is correct
26 Correct 106 ms 12280 KB Output is correct
27 Correct 266 ms 25228 KB Output is correct
28 Correct 246 ms 22136 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 245 ms 22136 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 416 KB Output is correct
40 Correct 11 ms 1408 KB Output is correct
41 Correct 290 ms 26232 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 6 ms 896 KB Output is correct
45 Correct 128 ms 14712 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 61 ms 5880 KB Output is correct
50 Correct 246 ms 22648 KB Output is correct
51 Correct 244 ms 22268 KB Output is correct
52 Correct 286 ms 25248 KB Output is correct
53 Correct 117 ms 12328 KB Output is correct
54 Correct 111 ms 12920 KB Output is correct
55 Correct 246 ms 22264 KB Output is correct
56 Correct 266 ms 24328 KB Output is correct
57 Correct 125 ms 12280 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 0 ms 384 KB Output is correct
60 Correct 5 ms 872 KB Output is correct
61 Correct 114 ms 14332 KB Output is correct
62 Correct 1 ms 288 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 68 ms 5880 KB Output is correct
66 Correct 148 ms 12792 KB Output is correct
67 Correct 134 ms 12280 KB Output is correct
68 Correct 114 ms 12408 KB Output is correct
69 Correct 107 ms 12280 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1408 KB Output is correct
7 Correct 307 ms 26232 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 14 ms 1280 KB Output is correct
13 Correct 250 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 124 ms 14712 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 61 ms 5880 KB Output is correct
21 Correct 265 ms 22772 KB Output is correct
22 Correct 242 ms 22136 KB Output is correct
23 Correct 260 ms 24184 KB Output is correct
24 Correct 247 ms 22192 KB Output is correct
25 Correct 122 ms 12780 KB Output is correct
26 Correct 106 ms 12280 KB Output is correct
27 Correct 266 ms 25228 KB Output is correct
28 Correct 246 ms 22136 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 245 ms 22136 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 416 KB Output is correct
40 Correct 11 ms 1408 KB Output is correct
41 Correct 290 ms 26232 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 6 ms 896 KB Output is correct
45 Correct 128 ms 14712 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 61 ms 5880 KB Output is correct
50 Correct 246 ms 22648 KB Output is correct
51 Correct 244 ms 22268 KB Output is correct
52 Correct 286 ms 25248 KB Output is correct
53 Correct 117 ms 12328 KB Output is correct
54 Correct 111 ms 12920 KB Output is correct
55 Correct 246 ms 22264 KB Output is correct
56 Correct 266 ms 24328 KB Output is correct
57 Correct 125 ms 12280 KB Output is correct
58 Correct 1 ms 512 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 0 ms 384 KB Output is correct
61 Correct 62 ms 5884 KB Output is correct
62 Correct 264 ms 22640 KB Output is correct
63 Correct 243 ms 22136 KB Output is correct
64 Correct 281 ms 24176 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 62 ms 5880 KB Output is correct
67 Correct 272 ms 22648 KB Output is correct
68 Correct 248 ms 22264 KB Output is correct
69 Correct 290 ms 25208 KB Output is correct
70 Correct 0 ms 384 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Correct 63 ms 5880 KB Output is correct
74 Correct 245 ms 22768 KB Output is correct
75 Correct 251 ms 22648 KB Output is correct
76 Correct 257 ms 22384 KB Output is correct
77 Correct 241 ms 22140 KB Output is correct
78 Correct 1 ms 384 KB Output is correct
79 Correct 0 ms 384 KB Output is correct
80 Correct 5 ms 872 KB Output is correct
81 Correct 114 ms 14332 KB Output is correct
82 Correct 1 ms 288 KB Output is correct
83 Correct 1 ms 384 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 68 ms 5880 KB Output is correct
86 Correct 148 ms 12792 KB Output is correct
87 Correct 134 ms 12280 KB Output is correct
88 Correct 114 ms 12408 KB Output is correct
89 Correct 107 ms 12280 KB Output is correct
90 Correct 1 ms 384 KB Output is correct
91 Correct 1 ms 384 KB Output is correct
92 Correct 5 ms 640 KB Output is correct
93 Correct 123 ms 8184 KB Output is correct
94 Correct 1 ms 384 KB Output is correct
95 Correct 1 ms 384 KB Output is correct
96 Correct 1 ms 384 KB Output is correct
97 Correct 24 ms 2328 KB Output is correct
98 Correct 102 ms 8184 KB Output is correct
99 Correct 100 ms 8184 KB Output is correct
100 Correct 112 ms 8184 KB Output is correct
101 Correct 118 ms 8184 KB Output is correct
102 Correct 117 ms 8176 KB Output is correct
103 Correct 102 ms 8184 KB Output is correct
104 Correct 99 ms 8184 KB Output is correct
105 Correct 117 ms 8172 KB Output is correct