POJ 3074 Sudoku（数独|Dancing Links精确覆盖）

题意：求解数独。

思路：原来先过一个裸暴力的，学习了DLX之后发现可以用来求解数独。

将原先数独的每一个格子的每一种取值看成一行，那么也就是一共有9*9*9行，因为数独要满足4个性质，即：

每一行被1-9填满，

每一列被1-9填满，

每一宫被1-9填满，

每一个空格被填满。

也就是说一共有（9+9+9）*9+81个列。

建完图之后用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;
const int maxnode = 400000;
const int MaxM = 400;
const int MaxN = 1000;
//精确覆盖任意解
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;
    }
    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为递归深度
    bool Dance(int d)
    {
        if(R[0] == 0)
        {
            ansd = d;
            return true;
        }
        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]);
			if(Dance(d+1))return true;
            for(int j = L[i]; j != i;j = L[j])resume(Col[j]);
        }
        resume(c);
        return false;
    }
} dlx;
char input[1000];
int num[1000];
int main() {
    //freopen("input.txt", "r", stdin);
	while(scanf("%s", input)==1 && input[0]!='e') {
		int len = strlen(input), cnt = 0, siz = 0;
		for(int i = 0; i < len; i++)
			if(input[i] == '.') cnt++;
		dlx.init(81-cnt+9*cnt, 81+(9+9+9)*9);
		for(int i = 0; i < len; i++) {
			if(input[i] == '.') {
				for(int j = 1; j <= 9; j++) {
					siz++;
					int x = i/9+1, y = i%9+1, z = (x-1)/3*3+(y-1)/3+1;
					dlx.Link(siz, i+1);
					dlx.Link(siz, 9*9+(x-1)*9+j);
					dlx.Link(siz, 9*9+9*9+(y-1)*9+j);
					dlx.Link(siz, 9*9+9*9+9*9+(z-1)*9+j);
					num[siz] = j;
				}
			}
			else {
				siz++;
				int x = i/9+1, y = i%9+1, z = (x-1)/3*3+(y-1)/3+1;
				dlx.Link(siz, i+1);
				dlx.Link(siz, 9*9+(x-1)*9+input[i]-'0');
				dlx.Link(siz, 9*9+9*9+(y-1)*9+input[i]-'0');
				dlx.Link(siz, 9*9+9*9+9*9+(z-1)*9+input[i]-'0');
				num[siz] = input[i] - '0';
			}
		}
		dlx.Dance(0);
		sort(dlx.ans, dlx.ans+81);
		for(int i = 0; i < dlx.ansd; i++) printf("%d", num[dlx.ans[i]]);
		puts("");
	}
    return 0;
}