Submission #785761

#	Time	Username	Problem	Language	Result	Execution time	Memory
785761		SlavicG	Political Development (BOI17_politicaldevelopment)	C++17	4 / 100	3065 ms	26104 KiB

politicaldevelopment

#include "bits/stdc++.h"
using namespace std;
 
#define ll long long
 
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()

const int N = 5e4 + 10;
unordered_set<int> st[N];
vector<int> adj[N];
int ans = 1;

void solve() {
    int n, k; cin >> n >> k;
    for(int i = 0; i < n; ++i) {
        int x; cin >> x; 
        if(x >= 1) {
            adj[i].resize(x);
            for(int j = 0; j < x; ++j) {
                cin >> adj[i][j];
                st[i].insert(adj[i][j]);
                st[adj[i][j]].insert(i);
            }
        } 
    }
    
    for(int i = 0; i < n; ++i) {
        if(sz(adj[i]) >= k) {
            ans = max(ans, 2);
            continue;
        }
        vector<int> dp(1 << (sz(adj[i])), 0);
        dp[0] = 1;
        for(int mask = 1; mask < (1 << (sz(adj[i]))); ++mask) {
            for(int j = 0; j < sz(adj[i]); ++j) {
                if(mask >> j & 1) {
                    bool ok = 1;
                    for(int f = 0; f < sz(adj[i]); ++f) {
                        if(f == j) continue;
                        if(mask >> f & 1) {
                            if(st[adj[i][j]].find(adj[i][f]) == st[adj[i][j]].end()) ok = false;
                        }
                    }
                    if(ok) dp[mask] |= dp[mask ^ (1 << j)];
                }
            }
            if(dp[mask]) {
                ans = max(ans, 1 + __builtin_popcount(mask));
            }
        }
    }
    cout << ans << "\n";
}   
 
int32_t main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
}

• Subtask 1: 4 / 4
• Subtask 2: 0 / 12
• Subtask 3: 0 / 23
• Subtask 4: 0 / 38
• Subtask 5: 0 / 23