POJ2676 Sudoku - Dancing Links

最新推荐文章于 2020-01-27 10:07:07 发布

Albafica

最新推荐文章于 2020-01-27 10:07:07 发布

阅读量428

点赞数

分类专栏： Dancing Links

本文链接：https://blog.csdn.net/lenleaves/article/details/8972452

版权

Dancing Links 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Sudoku

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 11558		Accepted: 5735		Special Judge

Description

Sudoku is a very simple task. A square table with 9 rows and 9 columns is divided to 9 smaller squares 3x3 as shown on the Figure. In some of the cells are written decimal digits from 1 to 9. The other cells are empty. The goal is to fill the empty cells with decimal digits from 1 to 9, one digit per cell, in such way that in each row, in each column and in each marked 3x3 subsquare, all the digits from 1 to 9 to appear. Write a program to solve a given Sudoku-task.

Input

The input data will start with the number of the test cases. For each test case, 9 lines follow, corresponding to the rows of the table. On each line a string of exactly 9 decimal digits is given, corresponding to the cells in this line. If a cell is empty it is represented by 0.

Output

For each test case your program should print the solution in the same format as the input data. The empty cells have to be filled according to the rules. If solutions is not unique, then the program may print any one of them.

Sample Input

Sample Output

#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<algorithm>

using namespace std;
//   列：（行+列+块）*9种可能+9*9个格子
//   行： 9*9*9  表示第i行第j列填k
const int MAXN=(9+9+9)*9+9*9+9*9*9*9*9*4+10;
#define INF 0xFFFFFF
int size;
int head,sz;
int U[MAXN],D[MAXN],L[MAXN],R[MAXN];
int H[MAXN],ROW[MAXN],C[MAXN],S[MAXN],O[MAXN];

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[C[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[C[j]];
            U[D[j]]=j;
            D[U[j]]=j;
          }
     }
     L[R[c]]=c;
     R[L[c]]=c;
}

bool dfs(int k)
{
    if(R[head]==head)
    {
        sort(O,O+9*9);
        int p=0;
        for(int i=0;i<9;i++)
        {
            for(int j=0;j<9;j++)
            {
                int num=O[p++];
                //cout<<num<<endl;
                num=num-(i*9+j)*9;
                printf("%d",num);
            }
            printf("\n");
        }
        printf("\n");
        return  true;
    }
    int s=INF,c;
    for (int t=R[head];t!=head;t=R[t])
    {
        if (S[t]<s)
        {
            s=S[t];
            c=t;
        }
     }
     remove(c);
     for(int i=D[c];i!=c;i=D[i])
     {
          O[k]=ROW[i];
          for(int j=R[i];j!=i;j=R[j])
              remove(C[j]);
          if(dfs(k+1))
               return  true;
          for(int j=L[i];j!=i;j=L[j])
               resume(C[j]);
     }
     resume(c);
     return  false;
}

void initDL(int n)
{
    head=0;
    for(int i=0;i<=n;i++)
    {
        U[i]=i;D[i]=i;
        L[i]=i-1;R[i]=i+1;
        S[i]=0;
    }
    R[n]=0;L[0]=n;S[0]=INF+1;
    sz=n+1;
    memset(H,0,sizeof(H));
}

void insert(int i, int j)
{
    if(H[i])
    {
        L[sz]=L[H[i]];
        R[sz]=H[i];
        L[R[sz]]=sz;
        R[L[sz]]=sz;
    }
    else
    {
        L[sz]=sz;
        R[sz]=sz;
        H[i]=sz;
    }
    U[sz]=U[j];
    D[sz]=j;
    U[D[sz]]=sz;
    D[U[sz]]=sz;
    C[sz]=j;
    ROW[sz]=i;
    ++S[j];
    ++sz;
}

char str[200][200];

void build()
{
    initDL(9*9*4);
    for(int i=0;i<9;i++)
        for(int j=1;j<=9;j++)
        {
            int base=(i*9+j-1)*9;
            if(str[i][j-1]=='0')
            {
                for(int k=1;k<=9;k++)
                {
                    int r;
                    r=base+k;
                    //第i行有数字k
                    insert(r,i*9+k);
                    //第j列有数字k
                    insert(r,9*9+(j-1)*9+k);
                    //第k块有数字k
                    int block=(j-1)/3*3+i/3;
                    insert(r,9*9*2+block*9+k);
                    //第i行j列有一个数字（限制一个格子只填一个数）
                    insert(r,9*9*3+i*9+j);
                }
            }
            else
            {
                int k=str[i][j-1]-'0';
                int r=base+k;
                //第i行有数字k
                insert(r,i*9+k);
                //第j列有数字k
                insert(r,9*9+(j-1)*9+k);
                //第k块有数字k
                int block=(j-1)/3*3+i/3;
                insert(r,9*9*2+block*9+k);
                //第i行j列有一个数字（限制一个格子只填一个数）
                insert(r,9*9*3+i*9+j);
            }
        }
}

int main()
{
    int t;
    size=9; //9*9数独
    scanf("%d",&t);
    gets(str[0]);
    while(t--)
    {
        for(int i=0;i<9;i++)
            gets(str[i]);
        build();
        dfs(0);
    }
    return 0;
}