ZOJ 3209 Treasure Map（Dancing Links）

题意：给出一个地图和若干碎片，现在要选取最少的碎片恢复地图，求最少的碎片数量。

思路：将每一个格子视为原来的一个列属性，有这一个格子的碎片这一列就为1，也就是说将这个二维的问题转化为了一个一维的dlx的问题，然后套模板求解即可。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<ctime>
#define eps 1e-6
#define LL long long
#define pii pair<int, int>
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;

//const int MAXN = 5000000 + 5;
const int INF = 0x3f3f3f3f;
int n;
const int maxnode = 500010;
const int MaxM = 1000;
const int MaxN = 550;
struct DLX
{
    int n,m,size;
    int U[maxnode],D[maxnode],R[maxnode],L[maxnode],Row[maxnode],Col[maxnode];
    int H[MaxN], S[MaxM];//H是每一行的头指针，S是每一列的节点数量 
    int ansd, ans[MaxN];
    void init(int _n,int _m)
    {
        n = _n;
        m = _m;
        for(int i = 0;i <= m;i++)
        {
            S[i] = 0;
            U[i] = D[i] = i;
            L[i] = i-1;
            R[i] = i+1;
        }
        R[m] = 0; L[0] = m;
        size = m;
        for(int i = 1;i <= n;i++)
            H[i] = -1;
        ansd = INF;
    }
    void Link(int r,int c)
    {
        ++S[Col[++size]=c];
        Row[size] = r;
        D[size] = D[c];
        U[D[c]] = size;
        U[size] = c;
        D[c] = size;
        if(H[r] < 0)H[r] = L[size] = R[size] = size;
        else
        {
            R[size] = R[H[r]];
            L[R[H[r]]] = size;
            L[size] = H[r];
            R[H[r]] = size;
        }
    }
    void remove(int c)
    {
        L[R[c]] = L[c]; R[L[c]] = R[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])
                ++S[Col[U[D[j]]=D[U[j]]=j]];
        L[R[c]] = R[L[c]] = c;
    }
    //d为递归深度
    void Dance(int d)
    {
		if(d >= ansd) return;
        if(R[0] == 0)
        {
            ansd = min(ansd, d);
            return;
        }
        int c = R[0];
        for(int i = R[0];i != 0;i = R[i])
            if(S[i] < S[c])
                c = i;
        remove(c);
        for(int i = D[c];i != c;i = D[i])
        {
            ans[d] = Row[i];
            for(int j = R[i]; j != i;j = R[j])remove(Col[j]);
            Dance(d+1);
            for(int j = L[i]; j != i;j = L[j])resume(Col[j]);
        }
        resume(c);
    }
} dlx;

int main() {
    //freopen("input.txt", "r", stdin);
	int T; 
	cin >> T;
	int r, c, p; 
	while(T--) {
		scanf("%d%d%d", &r, &c, &p);
		dlx.init(p, r*c);
		for(int i = 1; i <= p; i++) {
			int x1, x2, y1, y2;
			scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
			for(int j = x1+1; j <= x2; j++) {
				for(int k = y1+1; k <= y2; k++) {
					dlx.Link(i, (k-1)*r+j);
				}
			}
		}
		dlx.Dance(0);
		int ans;
		if(dlx.ansd == INF) ans = -1;
		else ans = dlx.ansd;
		printf("%d\n", ans);
	}
    return 0;
}