oj.uz

Submission #933740

# Submission time Handle Problem Language Result Execution time Memory
933740 2024-02-26T08:48:44 Z LucaIlie Political Development (BOI17_politicaldevelopment) C++17
4 / 100
 3000 ms 23016 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] )
            vertices.push_back( v );
        ans = max( ans, solve( vertices ) );

        adj[u].clear();
        for ( int v: adj[u] )
            adj[v].erase( v );
    }

    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 3164 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 146 ms 3932 KB Output is correct
4 Correct 254 ms 3932 KB Output is correct
5 Correct 255 ms 4092 KB Output is correct
6 Correct 143 ms 4124 KB Output is correct
7 Correct 140 ms 3932 KB Output is correct
8 Correct 132 ms 3412 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 150 ms 3164 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 146 ms 3932 KB Output is correct
4 Correct 254 ms 3932 KB Output is correct
5 Correct 255 ms 4092 KB Output is correct
6 Correct 143 ms 4124 KB Output is correct
7 Correct 140 ms 3932 KB Output is correct
8 Correct 132 ms 3412 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 150 ms 3164 KB Output is correct
11 Correct 250 ms 3928 KB Output is correct
12 Correct 299 ms 4096 KB Output is correct
13 Correct 1 ms 3160 KB Output is correct
14 Correct 250 ms 4092 KB Output is correct
15 Correct 1 ms 3164 KB Output is correct
16 Correct 153 ms 4140 KB Output is correct
17 Correct 2 ms 3164 KB Output is correct
18 Correct 140 ms 3932 KB Output is correct
19 Correct 125 ms 3160 KB Output is correct
20 Correct 128 ms 3676 KB Output is correct
21 Correct 136 ms 3676 KB Output is correct
22 Correct 127 ms 3192 KB Output is correct
23 Correct 150 ms 4140 KB Output is correct
24 Correct 126 ms 3164 KB Output is correct
25 Correct 144 ms 3928 KB Output is correct
26 Correct 138 ms 3932 KB Output is correct
27 Correct 128 ms 3932 KB Output is correct
28 Correct 137 ms 4088 KB Output is correct
29 Correct 128 ms 4052 KB Output is correct
30 Correct 216 ms 4208 KB Output is correct
31 Correct 147 ms 3932 KB Output is correct
32 Correct 223 ms 4220 KB Output is correct
33 Correct 143 ms 3932 KB Output is correct
34 Correct 138 ms 3920 KB Output is correct
35 Correct 35 ms 3676 KB Output is correct
36 Correct 35 ms 3676 KB Output is correct
37 Correct 35 ms 3676 KB Output is correct
38 Execution timed out 3055 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 125 ms 3196 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 2 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 3160 KB Output is correct
10 Correct 1 ms 3160 KB Output is correct
11 Execution timed out 3051 ms 23016 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 3164 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 146 ms 3932 KB Output is correct
4 Correct 254 ms 3932 KB Output is correct
5 Correct 255 ms 4092 KB Output is correct
6 Correct 143 ms 4124 KB Output is correct
7 Correct 140 ms 3932 KB Output is correct
8 Correct 132 ms 3412 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 150 ms 3164 KB Output is correct
11 Correct 250 ms 3928 KB Output is correct
12 Correct 299 ms 4096 KB Output is correct
13 Correct 1 ms 3160 KB Output is correct
14 Correct 250 ms 4092 KB Output is correct
15 Correct 1 ms 3164 KB Output is correct
16 Correct 153 ms 4140 KB Output is correct
17 Correct 2 ms 3164 KB Output is correct
18 Correct 140 ms 3932 KB Output is correct
19 Correct 125 ms 3160 KB Output is correct
20 Correct 128 ms 3676 KB Output is correct
21 Correct 136 ms 3676 KB Output is correct
22 Correct 127 ms 3192 KB Output is correct
23 Correct 150 ms 4140 KB Output is correct
24 Correct 126 ms 3164 KB Output is correct
25 Correct 144 ms 3928 KB Output is correct
26 Correct 138 ms 3932 KB Output is correct
27 Correct 128 ms 3932 KB Output is correct
28 Correct 137 ms 4088 KB Output is correct
29 Correct 128 ms 4052 KB Output is correct
30 Correct 216 ms 4208 KB Output is correct
31 Correct 147 ms 3932 KB Output is correct
32 Correct 223 ms 4220 KB Output is correct
33 Correct 143 ms 3932 KB Output is correct
34 Correct 138 ms 3920 KB Output is correct
35 Correct 35 ms 3676 KB Output is correct
36 Correct 35 ms 3676 KB Output is correct
37 Correct 35 ms 3676 KB Output is correct
38 Execution timed out 3055 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 3164 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 146 ms 3932 KB Output is correct
4 Correct 254 ms 3932 KB Output is correct
5 Correct 255 ms 4092 KB Output is correct
6 Correct 143 ms 4124 KB Output is correct
7 Correct 140 ms 3932 KB Output is correct
8 Correct 132 ms 3412 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 150 ms 3164 KB Output is correct
11 Correct 250 ms 3928 KB Output is correct
12 Correct 299 ms 4096 KB Output is correct
13 Correct 1 ms 3160 KB Output is correct
14 Correct 250 ms 4092 KB Output is correct
15 Correct 1 ms 3164 KB Output is correct
16 Correct 153 ms 4140 KB Output is correct
17 Correct 2 ms 3164 KB Output is correct
18 Correct 140 ms 3932 KB Output is correct
19 Correct 125 ms 3160 KB Output is correct
20 Correct 128 ms 3676 KB Output is correct
21 Correct 136 ms 3676 KB Output is correct
22 Correct 127 ms 3192 KB Output is correct
23 Correct 150 ms 4140 KB Output is correct
24 Correct 126 ms 3164 KB Output is correct
25 Correct 144 ms 3928 KB Output is correct
26 Correct 138 ms 3932 KB Output is correct
27 Correct 128 ms 3932 KB Output is correct
28 Correct 137 ms 4088 KB Output is correct
29 Correct 128 ms 4052 KB Output is correct
30 Correct 216 ms 4208 KB Output is correct
31 Correct 147 ms 3932 KB Output is correct
32 Correct 223 ms 4220 KB Output is correct
33 Correct 143 ms 3932 KB Output is correct
34 Correct 138 ms 3920 KB Output is correct
35 Correct 35 ms 3676 KB Output is correct
36 Correct 35 ms 3676 KB Output is correct
37 Correct 35 ms 3676 KB Output is correct
38 Execution timed out 3055 ms 3420 KB Time limit exceeded
39 Halted 0 ms 0 KB -