oj.uz

Submission #933738

# Submission time Handle Problem Language Result Execution time Memory
933738 2024-02-26T08:45:15 Z LucaIlie Political Development (BOI17_politicaldevelopment) C++17
4 / 100
 3000 ms 22904 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 5e4;
const int MAX_K = 10;
int perm[MAX_N], pos[MAX_N];
unordered_set<int> adj[MAX_N];

int solve( vector<int> vertices ) {
    int n = vertices.size();
    for ( int i = 0; i < n; i++ )
        pos[vertices[i]] = i;

    int ans = 0;
    for ( int mask = 0; mask < (1 << n); mask++ ) {
        int sz = __builtin_popcount( mask );
        bool ok = true;
        for ( int i = 0; i < n; i++ ) {
            if ( ((mask >> i) & 1) == 0 )
                continue;

            int u = vertices[i];

            int vec = 0;
            for ( int v: adj[u] ) {
                int j = pos[v];
                if ( j != -1 && ((mask >> j) & 1) )
                    vec++;
            }

            if ( vec != sz - 1 )
                ok = false;
        }
        if ( ok )
            ans = max( ans, sz );
    }
    for ( int i = 0; i < n; i++ )
        pos[vertices[i]] = -1;

    return ans;
}

int main() {
    int n, k, minn = n;

    cin >> n >> k;
    for ( int u = 0; u < n; u++ ) {
        int d;
        cin >> d;
        for ( int j = 0; j < d; j++ ) {
            int v;
            cin >> v;
            adj[u].insert( v );
        }
        minn = min( minn, d );
        perm[u] = u;
    }
    for ( int i = 0; i < n; i++ )
        pos[i] = -1;

    int ans = 0;
    for ( int i = 0; i < n; i++ ) {
        /*sort( perm + i, perm + n, []( int u, int v ) {
            return adj[u].size() < adj[v].size();
        } );*/


        int u = perm[i];
        vector<int> vertices;
        vertices.push_back( u );
        for ( int v: adj[u] ) {
            //adj[v].erase( u );
            vertices.push_back( v );
        }
        ans = max( ans, solve( vertices ) );
        //adj[u].clear();
    }

    vector<int> vertices;
    for ( int i = n - k; i < n; i++ ) {
        vertices.push_back( perm[i] );
    }

    ans = max( ans, solve( vertices ) );

    cout << ans;

    return 0;
}

Compilation message

politicaldevelopment.cpp: In function 'int main()':
politicaldevelopment.cpp:45:15: warning: 'n' is used uninitialized in this function [-Wuninitialized]
   45 |     int n, k, minn = n;
      |               ^~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 13 ms 4084 KB Output is correct
4 Correct 120 ms 3932 KB Output is correct
5 Correct 126 ms 4160 KB Output is correct
6 Correct 12 ms 3932 KB Output is correct
7 Correct 12 ms 4148 KB Output is correct
8 Correct 2 ms 3160 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 2 ms 3164 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 13 ms 4084 KB Output is correct
4 Correct 120 ms 3932 KB Output is correct
5 Correct 126 ms 4160 KB Output is correct
6 Correct 12 ms 3932 KB Output is correct
7 Correct 12 ms 4148 KB Output is correct
8 Correct 2 ms 3160 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 2 ms 3164 KB Output is correct
11 Correct 125 ms 4152 KB Output is correct
12 Correct 118 ms 3932 KB Output is correct
13 Correct 2 ms 3164 KB Output is correct
14 Correct 120 ms 3928 KB Output is correct
15 Correct 1 ms 3164 KB Output is correct
16 Correct 13 ms 3932 KB Output is correct
17 Correct 1 ms 3164 KB Output is correct
18 Correct 12 ms 4152 KB Output is correct
19 Correct 3 ms 3160 KB Output is correct
20 Correct 5 ms 3944 KB Output is correct
21 Correct 5 ms 3676 KB Output is correct
22 Correct 3 ms 3224 KB Output is correct
23 Correct 12 ms 3928 KB Output is correct
24 Correct 2 ms 3164 KB Output is correct
25 Correct 13 ms 4172 KB Output is correct
26 Correct 10 ms 4060 KB Output is correct
27 Correct 5 ms 4128 KB Output is correct
28 Correct 10 ms 3932 KB Output is correct
29 Correct 5 ms 3932 KB Output is correct
30 Correct 93 ms 4188 KB Output is correct
31 Correct 10 ms 4188 KB Output is correct
32 Correct 86 ms 4188 KB Output is correct
33 Correct 10 ms 4188 KB Output is correct
34 Correct 11 ms 4188 KB Output is correct
35 Correct 5 ms 3676 KB Output is correct
36 Correct 5 ms 3928 KB Output is correct
37 Correct 5 ms 3720 KB Output is correct
38 Execution timed out 3067 ms 3420 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3164 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 1 ms 3164 KB Output is correct
4 Correct 1 ms 3164 KB Output is correct
5 Correct 1 ms 3164 KB Output is correct
6 Correct 1 ms 3164 KB Output is correct
7 Correct 1 ms 3164 KB Output is correct
8 Correct 1 ms 3164 KB Output is correct
9 Correct 1 ms 3184 KB Output is correct
10 Correct 1 ms 3164 KB Output is correct
11 Execution timed out 3100 ms 22904 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 13 ms 4084 KB Output is correct
4 Correct 120 ms 3932 KB Output is correct
5 Correct 126 ms 4160 KB Output is correct
6 Correct 12 ms 3932 KB Output is correct
7 Correct 12 ms 4148 KB Output is correct
8 Correct 2 ms 3160 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 2 ms 3164 KB Output is correct
11 Correct 125 ms 4152 KB Output is correct
12 Correct 118 ms 3932 KB Output is correct
13 Correct 2 ms 3164 KB Output is correct
14 Correct 120 ms 3928 KB Output is correct
15 Correct 1 ms 3164 KB Output is correct
16 Correct 13 ms 3932 KB Output is correct
17 Correct 1 ms 3164 KB Output is correct
18 Correct 12 ms 4152 KB Output is correct
19 Correct 3 ms 3160 KB Output is correct
20 Correct 5 ms 3944 KB Output is correct
21 Correct 5 ms 3676 KB Output is correct
22 Correct 3 ms 3224 KB Output is correct
23 Correct 12 ms 3928 KB Output is correct
24 Correct 2 ms 3164 KB Output is correct
25 Correct 13 ms 4172 KB Output is correct
26 Correct 10 ms 4060 KB Output is correct
27 Correct 5 ms 4128 KB Output is correct
28 Correct 10 ms 3932 KB Output is correct
29 Correct 5 ms 3932 KB Output is correct
30 Correct 93 ms 4188 KB Output is correct
31 Correct 10 ms 4188 KB Output is correct
32 Correct 86 ms 4188 KB Output is correct
33 Correct 10 ms 4188 KB Output is correct
34 Correct 11 ms 4188 KB Output is correct
35 Correct 5 ms 3676 KB Output is correct
36 Correct 5 ms 3928 KB Output is correct
37 Correct 5 ms 3720 KB Output is correct
38 Execution timed out 3067 ms 3420 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 13 ms 4084 KB Output is correct
4 Correct 120 ms 3932 KB Output is correct
5 Correct 126 ms 4160 KB Output is correct
6 Correct 12 ms 3932 KB Output is correct
7 Correct 12 ms 4148 KB Output is correct
8 Correct 2 ms 3160 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 2 ms 3164 KB Output is correct
11 Correct 125 ms 4152 KB Output is correct
12 Correct 118 ms 3932 KB Output is correct
13 Correct 2 ms 3164 KB Output is correct
14 Correct 120 ms 3928 KB Output is correct
15 Correct 1 ms 3164 KB Output is correct
16 Correct 13 ms 3932 KB Output is correct
17 Correct 1 ms 3164 KB Output is correct
18 Correct 12 ms 4152 KB Output is correct
19 Correct 3 ms 3160 KB Output is correct
20 Correct 5 ms 3944 KB Output is correct
21 Correct 5 ms 3676 KB Output is correct
22 Correct 3 ms 3224 KB Output is correct
23 Correct 12 ms 3928 KB Output is correct
24 Correct 2 ms 3164 KB Output is correct
25 Correct 13 ms 4172 KB Output is correct
26 Correct 10 ms 4060 KB Output is correct
27 Correct 5 ms 4128 KB Output is correct
28 Correct 10 ms 3932 KB Output is correct
29 Correct 5 ms 3932 KB Output is correct
30 Correct 93 ms 4188 KB Output is correct
31 Correct 10 ms 4188 KB Output is correct
32 Correct 86 ms 4188 KB Output is correct
33 Correct 10 ms 4188 KB Output is correct
34 Correct 11 ms 4188 KB Output is correct
35 Correct 5 ms 3676 KB Output is correct
36 Correct 5 ms 3928 KB Output is correct
37 Correct 5 ms 3720 KB Output is correct
38 Execution timed out 3067 ms 3420 KB Time limit exceeded
39 Halted 0 ms 0 KB -