【POJ】3740 Easy Finding

#include<cstdio>
#define INF 0x7FFFFFFF
#define MAXN 90010
int n, m, size;
int L[MAXN], R[MAXN], U[MAXN], D[MAXN], H[MAXN];
int C[MAXN], S[MAXN];
void Init() {
    int i;
    for (i = 0; i <= m; i++) {
        S[i] = 0;
        L[i + 1] = i;
        R[i] = i + 1;
        U[i] = D[i] = i;
    }
    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]++;
    C[size++] = c;
}
void Remove(int c) {
    int i, j;
    R[L[c]] = R[c];
    L[R[c]] = L[c];
    for (i = D[c]; i != c; i = D[i]) {
        for (j = R[i]; j != i; j = R[j]) {
            U[D[j]] = U[j];
            D[U[j]] = D[j];
            S[C[j]]--;
        }
    }
}
void Resume(int c) {
    int i, j;
    R[L[c]] = c;
    L[R[c]] = c;
    for (i = D[c]; i != c; i = D[i]) {
        for (j = R[i]; j != i; j = R[j]) {
            U[D[j]] = j;
            D[U[j]] = j;
            S[C[j]]++;
        }
    }
}
bool Dance(int now) {
    if (R[0] == 0)
        return true;
    int i, j, temp, c;
    for (temp=INF,i = R[0]; i; i = R[i]) {
        if(S[i]<temp)
        {
            temp=S[i];
            c=i;
        }
    }
    Remove(c);
    for(i=D[c];i!=c;i=D[i])
    {
        for(j=R[i];j!=i;j=R[j])
            Remove(C[j]);
        if(Dance(now+1))
            return true;
        for(j=L[i];j!=i;j=L[j])
            Resume(C[j]);
    }
    Resume(c);
    return false;
}
int main() {
    int i, j, k;
    while (~scanf("%d%d", &n, &m)) {
        Init();
        for (i = 1; i <= n; i++) {
            H[i] = -1;
            for (j = 1; j <= m; j++) {
                scanf("%d", &k);
                if (k)
                    Link(i, j);
            }
        }
        if (Dance(0))
            puts("Yes, I found it");
        else
            puts("It is impossible");
    }
    return 0;
}