제출 #771902

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
771902		GrindMachine	Political Development (BOI17_politicaldevelopment)	C++17	0 / 100	18 ms	1620 KiB

politicaldevelopment

// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 5e4 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<int> adj[N];

void solve(int test_case)
{
    int n,k; cin >> n >> k;
    rep(i,n){
        int s; cin >> s;
        rep(j,s){
            int v; cin >> v;
            adj[i].pb(v);
        }
        sort(all(adj[i]));
    }

    int ans = 0;
    
    rep(i,n){
        vector<int> nodes;
        nodes.pb(i);
        trav(v,adj[i]){
            nodes.pb(v);
        }

        int siz = sz(nodes);
        vector<bool> dp(1<<siz);
        dp[0] = 1;

        rep(mask,1<<siz){
            vector<int> picked;
            rep(u,siz){
                if(mask & (1 << u)){
                    picked.pb(nodes[u]);
                }
            }

            rep(u,siz){
                if(mask & (1 << u)){
                    bool ok = true;
                    trav(v,picked){
                        if(u != v and !binary_search(all(adj[u]),v)){
                            ok = false;
                            break;
                        }
                    }

                    if(ok){
                        if(dp[mask^(1<<u)]){
                            dp[mask] = 1;
                            break;
                        }
                    }
                }
            }
        }

        rep(mask,1<<siz){
            if(dp[mask]){
                int cnt = setbits(mask);
                amax(ans,cnt);
            }
        }
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

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