ACM学习历程—UESTC 1222 Sudoku（矩阵）(2015CCPC H)

题目链接：http://acm.uestc.edu.cn/#/problem/show/1226

题目大意就是构造一个行列和每个角的2*2都是1234的4*4矩阵。

用dfs暴力搜索，不过需要每一步进行判断是否已经出现了重复，如果最后再判断的话复杂度有点高。

代码:

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <string>
#define LL long long

using namespace std;

char str[][];
int a[][];
bool vis[];
bool flag;

bool judge(int x[][])
{
    for (int i = ; i < ; ++i)
    {
        memset(vis, false, sizeof(vis));
        for (int j = ; j < ; ++j)
        {
            if (!x[i][j]) continue;
            if (vis[x[i][j]]) return false;
            else vis[x[i][j]] = true;
        }
    }
    for (int j = ; j < ; ++j)
    {
        memset(vis, false, sizeof(vis));
        for (int i = ; i < ; ++i)
        {
            if (!x[i][j]) continue;
            if (vis[x[i][j]]) return false;
            else vis[x[i][j]] = true;
        }
    }
    for (int i = ; i <= ; i += )
    {
        for (int j = ; j <= ; j += )
        {
            memset(vis, false, sizeof(vis));
            for (int xx = ; xx <= ; xx++)
            {
                for (int yy = ; yy <= ; yy++)
                {
                    if (!x[i+xx][j+yy]) continue;
                    if (vis[x[i+xx][j+yy]]) return false;
                    else vis[x[i+xx][j+yy]] = true;
                }
            }
        }
    }
    return true;
}

void input()
{
    for (int i = ; i < ; ++i)
    {
        scanf("%s", str[i]);
        for (int j = ; j < ; ++j)
        {
            if (str[i][j] == '*')
                a[i][j] = ;
            else
                a[i][j] = str[i][j]-'';
        }
    }
}

void dfs(int i, int j)
{
    if (flag) return;
    i += j/;
    j %= ;
    if (i == )
    {
        if (judge(a))
        {
            for (int i = ; i < ; ++i)
            {
                for (int j = ; j < ; ++j)
                    printf("%d", a[i][j]);
                printf("\n");
            }
            flag = true;
        }
        return;
    }
    if (!judge(a)) return;
    if (!a[i][j])
    {
        for (int x = ; x <= ; ++x)
        {
            a[i][j] = x;
            dfs(i, j+);
            a[i][j] = ;
        }
    }
    else dfs(i, j+);
}

void work()
{
    flag = false;
    dfs(, );
}

int main()
{
    //freopen("test.in", "r", stdin);
    int T;
    scanf("%d", &T);
    for (int times = ; times <= T; ++times)
    {
        printf("Case #%d:\n", times);
        input();
        work();
    }
    return ;
}