UVa 11825 - Hackers' Crackdown DP, 枚举子集substa = (substa - 1)&sta 难度: 2

#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#define LOCAL_DEBUG
using namespace std;
typedef pair<int, int> MyPair;
const int MAXN = 16;
const int MAXSTA = 1 << 16;
int edges[MAXN][MAXN];
int edgeCnt[MAXN];
int vis[MAXN];
int vis2[MAXSTA];
int dp[MAXSTA];

int main() {
#ifdef LOCAL_DEBUG
    freopen("C:\\Users\\Iris\\source\\repos\\ACM\\ACM\\input.txt", "r", stdin);
    //freopen("C:\\Users\\Iris\\source\\repos\\ACM\\ACM\\output.txt", "w", stdout);
#endif // LOCAL_DEBUG
    int n;
    for (int ti = 1; scanf("%d", &n) == 1 && n; ti++) {
        for (int i = 0; i < n; i++) {
            scanf("%d", edgeCnt + i);
            for (int j = 0; j < edgeCnt[i]; j++) {
                scanf("%d", edges[i] + j);
            }
        }
        int maxsta = (1 << n) - 1;
        for (int sta = 0; sta <= maxsta; sta++) {
            memset(vis, 0, sizeof vis);
            for (int i = 0; i < n; i++) {
                if (sta & (1 << i)) {
                    vis[i] = true;
                    for (int j = 0; j < edgeCnt[i]; j++) {
                        vis[edges[i][j]] = true;
                    }
                }
            }
            bool fl = true;
            for (int i = 0; i < n; i++) {
                if (!vis[i]) {
                    fl = false;
                }
            }
            if (fl) {
                dp[sta] = 1;
            }
            else {
                dp[sta] = 0;
            }
            
        }
        for (int sta = 0; sta <= maxsta; sta++) {
            for (int subSta = sta; subSta != 0; subSta = (subSta - 1) & sta) {
                dp[sta] = max(dp[sta], dp[sta ^ subSta] + dp[subSta]);
            }

        }
        printf("Case %d: %d\n", ti, dp[maxsta]);
    }

    return 0;
}