oj.uz

답안 #933742

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
933742 2024-02-26T08:55:01 Z LucaIlie Political Development (BOI17_politicaldevelopment) C++17
0 / 100
 615 ms 4376 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() } );
        }
    }

    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:53:15: warning: 'n' is used uninitialized in this function [-Wuninitialized]
   53 |     int n, k, minn = n;
      |               ^~~~

Subtask #1
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 27 ms 4188 KB Output is correct
4 Correct 615 ms 4376 KB Output is correct
5 Correct 611 ms 4188 KB Output is correct
6 Correct 38 ms 4184 KB Output is correct
7 Correct 37 ms 4184 KB Output is correct
8 Incorrect 3 ms 3420 KB Output isn't correct
9 Halted 0 ms 0 KB -

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 27 ms 4188 KB Output is correct
4 Correct 615 ms 4376 KB Output is correct
5 Correct 611 ms 4188 KB Output is correct
6 Correct 38 ms 4184 KB Output is correct
7 Correct 37 ms 4184 KB Output is correct
8 Incorrect 3 ms 3420 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 3420 KB Output isn't correct
2 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 27 ms 4188 KB Output is correct
4 Correct 615 ms 4376 KB Output is correct
5 Correct 611 ms 4188 KB Output is correct
6 Correct 38 ms 4184 KB Output is correct
7 Correct 37 ms 4184 KB Output is correct
8 Incorrect 3 ms 3420 KB Output isn't correct
9 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 27 ms 4188 KB Output is correct
4 Correct 615 ms 4376 KB Output is correct
5 Correct 611 ms 4188 KB Output is correct
6 Correct 38 ms 4184 KB Output is correct
7 Correct 37 ms 4184 KB Output is correct
8 Incorrect 3 ms 3420 KB Output isn't correct
9 Halted 0 ms 0 KB -