DLX重复覆盖 fzu1686 神龙的难题

传送门：点击打开链接

题意：告诉你一个矩阵大小，再告诉你0和1的分布，现在可以用n1*m1大小的矩形去覆盖所有的1，问至少要多少个矩形

思路：裸DLX重复覆盖，行为所有可能的矩形，列为每个点

wa点：DLX第一次找出来的不一定是最小的，但是可以用来与评估函数去比较剪枝，所以要继续搜索才行

#include<map>
#include<set>
#include<cmath>
#include<stack>
#include<queue>
#include<cstdio>
#include<cctype>
#include<string>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
#define fuck printf("fuck")
#define FIN freopen("input.txt","r",stdin)
#define FOUT freopen("output.txt","w+",stdout)
using namespace std;
typedef long long LL;

const int MX = 300 + 5;
const int MN = 90000 + 5;
const int INF = 0x3f3f3f3f;

struct DLX {
    int m, n, ans;
    int H[MX], S[MX], vis[MX];
    int Row[MN], Col[MN], rear;
    int L[MN], R[MN], U[MN], D[MN];

    void Init(int _m, int _n) {
        m = _m; n = _n;
        rear = n; ans = INF;
        for(int i = 0; i <= n; i++) {
            S[i] = 0;
            L[i] = i - 1;
            R[i] = i + 1;
            U[i] = D[i] = i;
        }
        L[0] = n; R[n] = 0;
        for(int i = 1; i <= m; i++) {
            H[i] = -1;
        }
    }

    void Link(int r, int c) {
        int rt = ++rear;
        Row[rt] = r; Col[rt] = c; S[c]++;

        D[rt] = D[c]; U[D[c]] = rt;
        U[rt] = c; D[c] = rt;
        if(H[r] == -1) {
            H[r] = L[rt] = R[rt] = rt;
        } else {
            int id = H[r];
            R[rt] = R[id]; L[R[id]] = rt;
            L[rt] = id; R[id] = rt;
        }
    }

    void Remove(int c) {
        for(int i = D[c]; i != c; i = D[i]) {
            R[L[i]] = R[i]; L[R[i]] = L[i];
        }
    }

    void Resume(int c) {
        for(int i = U[c]; i != c; i = U[i]) {
            R[L[i]] = L[R[i]] = i;
        }
    }

    int h() {
        int ret = 0;
        memset(vis, 0, sizeof(vis));
        for(int c = R[0]; c != 0; c = R[c]) {
            if(!vis[c]) {
                ret++;
                vis[c] = 1;
                for(int i = D[c]; i != c; i = D[i]) {
                    for(int j = R[i]; j != i; j = R[j]) {
                        vis[Col[j]] = 1;
                    }
                }
            }
        }
        return ret;
    }

    void Dance(int cnt) {
        if(cnt + h() >= ans) return;
        if(R[0] == 0) {
            ans = min(ans, cnt);
            return;
        }

        int c = R[0];
        for(int i = R[0]; i != 0; i = R[i]) {
            if(S[i] < S[c]) c = i;
        }

        for(int i = D[c]; i != c; i = D[i]) {
            Remove(i);
            for(int j = R[i]; j != i; j = R[j]) Remove(j);
            Dance(cnt + 1);
            for(int j = L[i]; j != i; j = L[j]) Resume(j);
            Resume(i);
        }
    }
} G;

int Point[MX][MX], rear;

int main() {
    int m, n, H, W, t; //FIN;
    while(~scanf("%d%d", &m, &n)) {
        rear = 0;
        for(int i = 1; i <= m; i++) {
            for(int j = 1; j <= n; j++) {
                scanf("%d", &t);
                Point[i][j] = t ? ++rear : 0;
            }
        }
        scanf("%d%d", &H, &W);
        G.Init((m - H + 1) * (n - W + 1), rear);
        for(int i = 1; i <= m - H + 1; i++) {
            for(int j = 1; j <= n - W + 1; j++) {
                int id = (i - 1) * (n - W + 1) + j;
                for(int x = i; x <= i + H - 1; x++) {
                    for(int y = j; y <= j + W - 1; y++) {
                        if(Point[x][y]) {
                            G.Link(id, Point[x][y]);
                        }
                    }
                }
            }
        }
        G.Dance(0);
        printf("%d\n", G.ans);
    }
    return 0;
}