oj.uz

답안 #933744

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
933744 2024-02-26T08:56:52 Z LucaIlie Political Development (BOI17_politicaldevelopment) C++17
4 / 100
 3000 ms 25244 KB 
#include <bits/stdc++.h>

using namespace std;

struct pv {
    int u, a;

    bool operator < ( const pv &x ) const {
        if ( a == x.a )
            return u < x.u;
        return a < x.a;
    }
};

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

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++ ) {
        vector<int> v;
        for ( int i = 0; i < n; i++ ) {
            if ( (mask >> i) & 1)
                v.push_back( vertices[i] );
        }

        bool ok = true;
        for ( int x: v ) {
            for ( int y: v ) {
                if ( x != y && adj[x].find( y ) == adj[x].end() )
                    ok = false;
            }
        }

        if ( ok )
            ans = max( ans, (int)v.size() );
    }

    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 );
        vertMinSize.insert( { u, d } );
    }
    for ( int i = 0; i < n; i++ )
        pos[i] = -1;

    int ans = 0;
    for ( int i = 0; i < n; i++ ) {
        int u = vertMinSize.begin()->u;

        vector<int> vertices;
        vertices.push_back( u );
        for ( int v: adj[u] )
            vertices.push_back( v );
        ans = max( ans, solve( vertices ) );

        vertMinSize.erase( { u, (int)adj[u].size() } );
        adj[u].clear();
        for ( int v: adj[u] ) {
            vertMinSize.erase( { v, (int)adj[v].size() } );
            adj[v].erase( v );
            vertMinSize.insert( { v, (int)adj[v].size() } );
        }
    }

    cout << ans;

    return 0;
}

Compilation message

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

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 28 ms 4280 KB Output is correct
4 Correct 615 ms 4368 KB Output is correct
5 Correct 613 ms 4368 KB Output is correct
6 Correct 38 ms 4188 KB Output is correct
7 Correct 37 ms 4336 KB Output is correct
8 Correct 3 ms 3420 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 3 ms 3420 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 28 ms 4280 KB Output is correct
4 Correct 615 ms 4368 KB Output is correct
5 Correct 613 ms 4368 KB Output is correct
6 Correct 38 ms 4188 KB Output is correct
7 Correct 37 ms 4336 KB Output is correct
8 Correct 3 ms 3420 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 3 ms 3420 KB Output is correct
11 Correct 618 ms 4368 KB Output is correct
12 Correct 614 ms 4376 KB Output is correct
13 Correct 1 ms 3164 KB Output is correct
14 Correct 616 ms 4444 KB Output is correct
15 Correct 1 ms 3160 KB Output is correct
16 Correct 37 ms 4188 KB Output is correct
17 Correct 1 ms 3164 KB Output is correct
18 Correct 37 ms 4360 KB Output is correct
19 Correct 3 ms 3416 KB Output is correct
20 Correct 6 ms 3932 KB Output is correct
21 Correct 6 ms 3932 KB Output is correct
22 Correct 3 ms 3420 KB Output is correct
23 Correct 17 ms 4216 KB Output is correct
24 Correct 3 ms 3416 KB Output is correct
25 Correct 18 ms 4188 KB Output is correct
26 Correct 15 ms 4316 KB Output is correct
27 Correct 8 ms 4184 KB Output is correct
28 Correct 15 ms 4188 KB Output is correct
29 Correct 8 ms 4184 KB Output is correct
30 Correct 11 ms 4440 KB Output is correct
31 Correct 15 ms 4392 KB Output is correct
32 Correct 12 ms 4444 KB Output is correct
33 Correct 14 ms 4396 KB Output is correct
34 Correct 13 ms 4188 KB Output is correct
35 Correct 9 ms 3672 KB Output is correct
36 Correct 8 ms 3672 KB Output is correct
37 Correct 7 ms 3676 KB Output is correct
38 Execution timed out 3093 ms 3420 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3416 KB Output is correct
2 Correct 1 ms 3160 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 2 ms 3164 KB Output is correct
8 Correct 1 ms 3164 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 1 ms 3160 KB Output is correct
11 Execution timed out 3060 ms 25244 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 28 ms 4280 KB Output is correct
4 Correct 615 ms 4368 KB Output is correct
5 Correct 613 ms 4368 KB Output is correct
6 Correct 38 ms 4188 KB Output is correct
7 Correct 37 ms 4336 KB Output is correct
8 Correct 3 ms 3420 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 3 ms 3420 KB Output is correct
11 Correct 618 ms 4368 KB Output is correct
12 Correct 614 ms 4376 KB Output is correct
13 Correct 1 ms 3164 KB Output is correct
14 Correct 616 ms 4444 KB Output is correct
15 Correct 1 ms 3160 KB Output is correct
16 Correct 37 ms 4188 KB Output is correct
17 Correct 1 ms 3164 KB Output is correct
18 Correct 37 ms 4360 KB Output is correct
19 Correct 3 ms 3416 KB Output is correct
20 Correct 6 ms 3932 KB Output is correct
21 Correct 6 ms 3932 KB Output is correct
22 Correct 3 ms 3420 KB Output is correct
23 Correct 17 ms 4216 KB Output is correct
24 Correct 3 ms 3416 KB Output is correct
25 Correct 18 ms 4188 KB Output is correct
26 Correct 15 ms 4316 KB Output is correct
27 Correct 8 ms 4184 KB Output is correct
28 Correct 15 ms 4188 KB Output is correct
29 Correct 8 ms 4184 KB Output is correct
30 Correct 11 ms 4440 KB Output is correct
31 Correct 15 ms 4392 KB Output is correct
32 Correct 12 ms 4444 KB Output is correct
33 Correct 14 ms 4396 KB Output is correct
34 Correct 13 ms 4188 KB Output is correct
35 Correct 9 ms 3672 KB Output is correct
36 Correct 8 ms 3672 KB Output is correct
37 Correct 7 ms 3676 KB Output is correct
38 Execution timed out 3093 ms 3420 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 28 ms 4280 KB Output is correct
4 Correct 615 ms 4368 KB Output is correct
5 Correct 613 ms 4368 KB Output is correct
6 Correct 38 ms 4188 KB Output is correct
7 Correct 37 ms 4336 KB Output is correct
8 Correct 3 ms 3420 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 3 ms 3420 KB Output is correct
11 Correct 618 ms 4368 KB Output is correct
12 Correct 614 ms 4376 KB Output is correct
13 Correct 1 ms 3164 KB Output is correct
14 Correct 616 ms 4444 KB Output is correct
15 Correct 1 ms 3160 KB Output is correct
16 Correct 37 ms 4188 KB Output is correct
17 Correct 1 ms 3164 KB Output is correct
18 Correct 37 ms 4360 KB Output is correct
19 Correct 3 ms 3416 KB Output is correct
20 Correct 6 ms 3932 KB Output is correct
21 Correct 6 ms 3932 KB Output is correct
22 Correct 3 ms 3420 KB Output is correct
23 Correct 17 ms 4216 KB Output is correct
24 Correct 3 ms 3416 KB Output is correct
25 Correct 18 ms 4188 KB Output is correct
26 Correct 15 ms 4316 KB Output is correct
27 Correct 8 ms 4184 KB Output is correct
28 Correct 15 ms 4188 KB Output is correct
29 Correct 8 ms 4184 KB Output is correct
30 Correct 11 ms 4440 KB Output is correct
31 Correct 15 ms 4392 KB Output is correct
32 Correct 12 ms 4444 KB Output is correct
33 Correct 14 ms 4396 KB Output is correct
34 Correct 13 ms 4188 KB Output is correct
35 Correct 9 ms 3672 KB Output is correct
36 Correct 8 ms 3672 KB Output is correct
37 Correct 7 ms 3676 KB Output is correct
38 Execution timed out 3093 ms 3420 KB Time limit exceeded
39 Halted 0 ms 0 KB -