oj.uz

Submission #300564

# Submission time Handle Problem Language Result Execution time Memory
300564 2020-09-17T09:36:36 Z muhammad_hokimiyon Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 305 ms 30936 KB 
#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>

using namespace std;

const int maxn = 200200;

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] == 0 )continue;
            if( p[i][j] == 3 || p[i][j] != p[j][i] )return 0;
            if( p[i][j] == 1 ){
                v[i].push_back(j);
            }
        }
    }
    vector < vector < int > > ans( n , vector < int > (n , 0) );
    vector < int > fg;
    for( int it = 0; it < n; it++ ){
        if( used[it] )continue;
        c.clear();
        dfs( it );
        fg.push_back(it);
        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();
        }else if( cnt2 > 0 )return 0;
    }
    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 );
        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;
                }
            }
        }
    }
    if( !fg.empty() && (int)fg.size() < 3 )return 0;
    for( int i = 0; i + 1 < (int)fg.size(); i++ ){
        int x = fg[i] , y = fg[i + 1];
        ans[x][y] = ans[y][x] = 1;
    }
    if( !fg.empty() ){
        int x = fg[0] , y = fg.back();
        ans[x][y] = ans[y][x] = 1;
    }
    build( ans );
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5024 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 16 ms 6144 KB Output is correct
7 Correct 293 ms 30936 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5024 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 16 ms 6144 KB Output is correct
7 Correct 293 ms 30936 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 14 ms 5888 KB Output is correct
13 Correct 257 ms 27000 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 9 ms 5632 KB Output is correct
17 Correct 131 ms 19320 KB Output is correct
18 Correct 4 ms 4992 KB Output is correct
19 Correct 4 ms 4992 KB Output is correct
20 Correct 66 ms 10616 KB Output is correct
21 Correct 261 ms 27256 KB Output is correct
22 Correct 260 ms 26872 KB Output is correct
23 Correct 275 ms 28792 KB Output is correct
24 Correct 256 ms 26872 KB Output is correct
25 Correct 115 ms 17400 KB Output is correct
26 Correct 115 ms 16888 KB Output is correct
27 Correct 284 ms 29816 KB Output is correct
28 Correct 260 ms 26872 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 4 ms 5120 KB Output is correct
6 Correct 4 ms 5120 KB Output is correct
7 Correct 4 ms 4992 KB Output is correct
8 Correct 14 ms 5888 KB Output is correct
9 Correct 254 ms 26932 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 3 ms 4992 KB Output is correct
12 Correct 16 ms 6144 KB Output is correct
13 Correct 305 ms 30864 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 9 ms 5504 KB Output is correct
17 Correct 126 ms 17016 KB Output is correct
18 Correct 3 ms 4992 KB Output is correct
19 Correct 4 ms 4992 KB Output is correct
20 Incorrect 4 ms 4992 KB Answer gives possible 0 while actual possible 1
21 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 68 ms 10616 KB Output is correct
5 Correct 260 ms 27400 KB Output is correct
6 Correct 251 ms 27000 KB Output is correct
7 Correct 272 ms 28920 KB Output is correct
8 Incorrect 4 ms 5024 KB Answer gives possible 0 while actual possible 1
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5024 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 16 ms 6144 KB Output is correct
7 Correct 293 ms 30936 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 14 ms 5888 KB Output is correct
13 Correct 257 ms 27000 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 9 ms 5632 KB Output is correct
17 Correct 131 ms 19320 KB Output is correct
18 Correct 4 ms 4992 KB Output is correct
19 Correct 4 ms 4992 KB Output is correct
20 Correct 66 ms 10616 KB Output is correct
21 Correct 261 ms 27256 KB Output is correct
22 Correct 260 ms 26872 KB Output is correct
23 Correct 275 ms 28792 KB Output is correct
24 Correct 256 ms 26872 KB Output is correct
25 Correct 115 ms 17400 KB Output is correct
26 Correct 115 ms 16888 KB Output is correct
27 Correct 284 ms 29816 KB Output is correct
28 Correct 260 ms 26872 KB Output is correct
29 Correct 4 ms 4992 KB Output is correct
30 Correct 4 ms 4992 KB Output is correct
31 Correct 3 ms 4992 KB Output is correct
32 Correct 3 ms 4992 KB Output is correct
33 Correct 4 ms 5120 KB Output is correct
34 Correct 4 ms 5120 KB Output is correct
35 Correct 4 ms 4992 KB Output is correct
36 Correct 14 ms 5888 KB Output is correct
37 Correct 254 ms 26932 KB Output is correct
38 Correct 4 ms 4992 KB Output is correct
39 Correct 3 ms 4992 KB Output is correct
40 Correct 16 ms 6144 KB Output is correct
41 Correct 305 ms 30864 KB Output is correct
42 Correct 4 ms 4992 KB Output is correct
43 Correct 4 ms 4992 KB Output is correct
44 Correct 9 ms 5504 KB Output is correct
45 Correct 126 ms 17016 KB Output is correct
46 Correct 3 ms 4992 KB Output is correct
47 Correct 4 ms 4992 KB Output is correct
48 Incorrect 4 ms 4992 KB Answer gives possible 0 while actual possible 1
49 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5024 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 16 ms 6144 KB Output is correct
7 Correct 293 ms 30936 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 14 ms 5888 KB Output is correct
13 Correct 257 ms 27000 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 9 ms 5632 KB Output is correct
17 Correct 131 ms 19320 KB Output is correct
18 Correct 4 ms 4992 KB Output is correct
19 Correct 4 ms 4992 KB Output is correct
20 Correct 66 ms 10616 KB Output is correct
21 Correct 261 ms 27256 KB Output is correct
22 Correct 260 ms 26872 KB Output is correct
23 Correct 275 ms 28792 KB Output is correct
24 Correct 256 ms 26872 KB Output is correct
25 Correct 115 ms 17400 KB Output is correct
26 Correct 115 ms 16888 KB Output is correct
27 Correct 284 ms 29816 KB Output is correct
28 Correct 260 ms 26872 KB Output is correct
29 Correct 4 ms 4992 KB Output is correct
30 Correct 4 ms 4992 KB Output is correct
31 Correct 3 ms 4992 KB Output is correct
32 Correct 3 ms 4992 KB Output is correct
33 Correct 4 ms 5120 KB Output is correct
34 Correct 4 ms 5120 KB Output is correct
35 Correct 4 ms 4992 KB Output is correct
36 Correct 14 ms 5888 KB Output is correct
37 Correct 254 ms 26932 KB Output is correct
38 Correct 4 ms 4992 KB Output is correct
39 Correct 3 ms 4992 KB Output is correct
40 Correct 16 ms 6144 KB Output is correct
41 Correct 305 ms 30864 KB Output is correct
42 Correct 4 ms 4992 KB Output is correct
43 Correct 4 ms 4992 KB Output is correct
44 Correct 9 ms 5504 KB Output is correct
45 Correct 126 ms 17016 KB Output is correct
46 Correct 3 ms 4992 KB Output is correct
47 Correct 4 ms 4992 KB Output is correct
48 Incorrect 4 ms 4992 KB Answer gives possible 0 while actual possible 1
49 Halted 0 ms 0 KB -