【HDU】3957 Street Fighter

#include<cstdio>
#include<cstring>
#define MAXM 110
#define MAXN 100000
#define INF 0x7FFFFFFF
bool G[MAXM][MAXM];
int L[MAXN], R[MAXN], U[MAXN], D[MAXN];
int S[MAXN], X[MAXN], C[MAXN], H[MAXN];
int size, depth;
bool vis[MAXM], has[MAXM];
void Init(int m) {
    int i;
    memset(vis, false, sizeof(vis));
    memset(G, false, sizeof(G));
    for (i = 0; i <= m; i++) {
        L[i + 1] = i;
        R[i] = i + 1;
        U[i] = D[i] = i;
        S[i] = 0;
        H[i] = -1;
    }
    R[m] = 0;
    size = m + 1;
}
void Link(int r, int c) {
    U[size] = c;
    D[size] = D[c];
    U[D[c]] = size;
    D[c] = size;
    if (H[r] < 0)
        H[r] = L[size] = R[size] = size;
    else {
        L[size] = H[r];
        R[size] = R[H[r]];
        L[R[H[r]]] = size;
        R[H[r]] = size;
    }
    S[c]++;
    X[size] = r;
    C[size++] = c;
}
int A() {
    int i, j, k, res;
    memset(has, false, sizeof(has));
    for (res = 0, i = R[0]; i; i = R[i]) {
        if (has[i])
            continue;
        res++;
        for (j = D[i]; j != i; j = D[j]) {
            for (k = R[j]; k != j; k = R[k])
                has[C[k]] = true;
        }
    }
    return res;
}
void Remove(int c) {
    int i;
    for (i = D[c]; i != c; i = D[i]) {
        L[R[i]] = L[i];
        R[L[i]] = R[i];
    }
}
void Resume(int c) {
    int i;
    for (i = D[c]; i != c; i = D[i])
        L[R[i]] = R[L[i]] = i;
}
bool Dance(int now) {
    if (now + A() > depth)
        return false;
    if (R[0] == 0)
        return true;
    int i, j, c, temp;
    for (temp = INF,i = R[0]; i; i = R[i]) {
        if (temp > S[i]) {
            temp = S[i];
            c = i;
        }
    }
    for (i = D[c]; i != c; i = D[i]) {
        if (vis[X[i]] || vis[X[i] ^ 1])
            continue;
        vis[X[i]] = true;
        Remove(i);
        for (j = R[i]; j != i; j = R[j])
            Remove(j);
        if (Dance(now + 1))
            return true;
        for (j = L[i]; j != i; j = L[j])
            Resume(j);
        Resume(i);
        vis[X[i]] = false;
    }
    return false;
}
void Build(int n) {
    int i, j;
    for (i = 0; i < n; i++) {
        for (j = 0; j < n; j++) {
            if (G[i][j])
                Link(i, j + 1);
        }
    }
}
int main() {
    int T, ca = 1;
    int n, m, i, j, k, x, y;
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        Init(n << 1);
        for (i = 0; i < n; i++) {
            scanf("%d", &m);
            for (j = 0; j < m; j++) {
                scanf("%d", &k);
                while (k--) {
                    scanf("%d%d", &x, &y);
                    G[(i << 1) + j][(x << 1) + y] = true;
                }
            }
            if (m == 1) {
                for (k = 0; k < (n << 1); k++)
                    G[k][(i << 1) + j] = true;
            }
            G[i << 1][i << 1] = G[i << 1 | 1][i << 1] = true;
            G[i << 1][i << 1 | 1] = G[i << 1 | 1][i << 1 | 1] = true;
        }
        Build(n << 1);
        for (depth = 1; depth < n && !Dance(0); depth++)
            ;
        printf("Case %d: %d\n", ca++, depth);
    }
    return 0;
}