51 nod 1211 数独 DLX

原题链接：http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1211

调了挺久的，自己的一份舞蹈链模板……

算是在网上见到的模板中比较短的一份吧(2.2K)

#include<cstdio>
#include<algorithm>
#include<ctime>
#define MN 300000
using namespace std;
int read_p,read_ca;
inline int read(){
    read_p=;read_ca=getchar();
    while(read_ca<''||read_ca>'') read_ca=getchar();
    while(read_ca>=''&&read_ca<='') read_p=read_p*+read_ca-,read_ca=getchar();
    return read_p;
}
int n,m,l[MN],r[MN],d[MN],u[MN],X[MN],Y[MN],Z[MN],mmh[MN],st[MN],_MMH,_mmh[MN],_h[MN],map[][],_a[MN],top=,c,Num,_L[MN],s[MN],MMH=,NN=,a,num=,h=;
bool Bo[MN];
inline void rec(){int x=st[top--];d[u[x]]=x;u[d[x]]=x;l[r[x]]=x;r[l[x]]=x;s[_L[x]]++;}
inline void del(int x){if (Bo[_L[x]]) return;s[_L[x]]--;st[++top]=x;d[u[x]]=d[x];u[d[x]]=u[x];l[r[x]]=l[x];r[l[x]]=r[x];}
inline void tadd(int l,int x){u[d[u[l]]=x]=u[l];d[u[l]=x]=l;_L[x]=l;s[l]++;}
inline void hadd(int x,int y,int z){
    h++;X[h]=x;Y[h]=y;Z[h]=z;
    tadd(x*-+y,++num);tadd(x*-+z+,++num);tadd(y*-+z+,++num);tadd(((x-)/*+(y+)/)*-+z+,++num);
    r[num-]=num-;r[num-]=num-;r[num-]=num;r[num]=num-;
    l[num-]=num;l[num-]=num-;l[num-]=num-;l[num]=num-;
    _h[num-]=_h[num-]=_h[num-]=_h[num]=h;
}
void work(int p){
    NN++;
    register int i,j,k,o;
    if (MMH==) return;
    if (!r[]){
        _MMH=p-;
        for (i=;i<=_MMH;i++) _mmh[i]=mmh[i];
        MMH++;
        return;
    }
    int bo=top,t,mr=1e9;c=;
    for (i=r[];i;i=r[i]){
        if (d[i]==i) return;
        if (mr>s[i]){
            mr=s[i];
            t=i;
        }
    }
    for (i=d[t];i!=t;i=d[i]){
        mmh[p]=_h[i];
        for (j=i;;j=r[j]){
            for (k=j;;k=d[k]){
                for (o=k;;o=r[o]){
                    if (Bo[o]) break;
                    Bo[_a[++c]=o]=;
                    if (r[o]==k||o<=) break;
                }
                if (d[k]==j) break;
            }
            if (r[j]==i) break;
        }
        for (j=c;j;j--) del(_a[j]);
        while (c) Bo[_a[c--]]=;
        work(p+);
        while (top>bo) rec();
    }
}
int main(){
    register int i,j,k;
    for (i=;i<=num;i++) l[i]=i==?num:i-,r[i]=i==num?:i+,u[i]=d[i]=i;
    for (i=;i<=;i++)
    for (j=;j<=;j++){
        a=read();
        if (a) hadd(i,j,a);else
        for (k=;k<=;k++) hadd(i,j,k);
    }
    work();
    if (MMH!=) return printf("No Solution\n"),;
    for (i=;i<=_MMH;i++) map[X[_mmh[i]]][Y[_mmh[i]]]=Z[_mmh[i]];
    for (i=;i<=;printf("\n"),i++)
    for (j=;j<=;j++) printf("%d ",map[i][j]);
}