跳舞链——精确覆盖问题【template】

最新推荐文章于 2023-07-17 07:30:00 发布

Irish_Moonshine

最新推荐文章于 2023-07-17 07:30:00 发布

阅读量306

点赞数

分类专栏： Template

本文链接：https://blog.csdn.net/Irish_Moonshine/article/details/79112875

版权

Template 专栏收录该内容

17 篇文章 0 订阅

订阅专栏

学习并参考自
http://blog.csdn.net/qq_32400847/article/details/51831009

#include<iostream>
using namespace std;
#define maxm 110
#define maxn 110
#define Max 10050
int Row[maxn], Col[maxm], U[Max], D[Max], R[Max], L[Max], H[maxn], S[Max];
int n, m, k, tmp, id;
void init() {
    for (int i = 0; i <= m; i++) {
        S[i] = 0;
        L[i] = i - 1;
        R[i] = i + 1;
        U[i] = i;
        D[i] = i;
    }
    L[0] = m;
    R[m] = 0;
    for (int i = 0; i <= n; i++) {
        H[i] = -1;
    }
}
void add(int row, int col, int id) {
    Row[id] = row;
    Col[id] = col;
    U[id] = U[col];//U\D\R\L存的都是id。
    D[id] = col;
    D[U[col]] = id;
    U[col] = id;
    if (H[row] == -1) {//如果当前只有自己，所有的都指向自己
        L[id] = R[id] = H[row] = id;
    }
    else {
        L[id] = L[H[row]];
        R[L[H[row]]] = id;
        R[id] = H[row];
        L[H[row]] = id;
    }
    S[col]++;
}
void remove(int c) {//相当于两边夹起来，空出了中间
    R[L[c]] = R[c];
    L[R[c]] = L[c];
    for (int i = D[c]; i != c; i = D[i]) {
        for (int j = R[i]; j != i; j = R[j]) {
            U[D[j]] = U[j];
            D[U[j]] = D[j];
            --S[Col[j]];
        }
    }
}
void resume(int c) {//逆向恢复
    for (int i = U[c]; i != c; i = U[i]) {
        for (int j = L[i]; j != i; j = L[j]) {
            U[D[j]] = j;
            D[U[j]] = j;
            ++S[Col[j]];
        }
    }
    L[R[c]] = R[L[c]] = c;
}
bool dance(int d) {
    if (R[0] == 0)  return true;
    int c = R[0];
    for (int i = c; i != 0; i = R[i]) {
        if (S[i] < S[c]) c = i;//选择节点最少的那一列
    }
    remove(c);
    for (int i = D[c]; i != c; i = D[i]) {
        for (int j = R[i]; j != i; j = R[j]) remove(Col[j]);
        if (dance(d + 1)) return true;
        for (int j = L[i]; j != i; j = L[j]) resume(Col[j]);
    }
    resume(c);
    return false;
}
int main()
{
    int T;
    scanf("%d", &T);
    while (T--) {
        scanf("%d%d", &n, &m);
        id = m;
        init();
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                scanf("%d", &tmp);
                if (tmp) {
                    id++;
                    add(i, j, id);
                }
            }
        }
        if (dance(0)) {
            printf("Yes\n");
        }
        else {
            printf("No\n");
        }
    }
    return 0;
}