【HDOJ】3006 The Number of set

位运算标记状态。

#include 
#include 
#include 

#define MAXN 15

bool visit[1<<MAXN];

int main() {
    int n, m;
    int i, j, k, v;
    int ans;
    
#ifndef ONLINE_JUDGE
    freopen("data.in", "r", stdin);
#endif
    
    while (scanf("%d %d", &n, &m) != EOF) {
        memset(visit, false, sizeof(visit));
        while (n--) {
            scanf("%d", &k);
            v = 0;
            while (k--) {
                scanf("%d", &j);
                v |= 1<<(j-1);
            }
            visit[v] = true;
            for (i=1; i<(1<i) {
                if (visit[i]) {
                    visit[i|v] = true;
                }
            }
        }
        ans = 0;
        for (i=1; i<(1<i)
            if (visit[i])
                ++ans;
        printf("%d
", ans);
    }

    return 0;
}