ACdream 1195 Sudoku Checker（模拟）

ACdream 1195 

题意：检测数独是否合法，直接检测每一行，每一列，矩形区域n*n个矩形区域即可！

          标记数组要开到1000.

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <stack>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
using namespace std;
#define LL long long
#define N 50
#define M 1002
#define DEBUG puts("It's here!")
#define INF 1<<29
#define CLS(x,v) memset(x,v,sizeof(x))
#define FOR(i,a,n)  for(int i=(a);i<=(n);++i)
#define filer freopen("C:\\Users\\sq\\Desktop\\data.in","r",stdin);
#define filew freopen("C:\\Users\\sq\\Desktop\\data.out","w",stdout);


int g[N][N];
int n,m;
bool vis[M]={0};
bool check_row(int i,int n)
{
    CLS(vis,0);
    for(int k=1;k<=n;k++)
        vis[g[i][k]]=1;
    for(int k=1;k<=n;k++)
        if(!vis[k])return 0;
    return 1;
}
bool check_col(int i,int n)
{
    CLS(vis,0);
    for(int k=1;k<=n;k++)
        vis[g[k][i]]=1;
    for(int k=1;k<=n;k++)
        if(!vis[k])return 0;
    return 1;
}
bool check_squre(int i,int j,int m)
{
    CLS(vis,0);
    for(int x=i;x<i+m;x++)
    for(int y=j;y<j+m;y++)
        vis[g[x][y]]=1;
    for(int k=1;k<=n;k++)
        if(!vis[k])return 0;
    return 1;
}
int main()
{
    int T,flag;
    scanf("%d",&T);
    for(int k=1;k<=T;k++)
    {
        scanf("%d",&m);
        n=m*m;
        FOR(i,1,n)FOR(j,1,n)
         scanf("%d",&g[i][j]);
         printf("Case #%d: ",k);
         flag=0;
        for(int i=1;i<=n;i++)
        if(!check_row(i,n))
        {
            flag=1;break;

        }
        if(flag){puts("No");continue;}
        for(int i=1;i<=n;i++)
        if(!check_col(i,n))
        {
//            DEBUG;
            flag=1;break;
        }
        if(flag){puts("No");continue;}
        ////
        for(int i=1;i<n;i+=m)
        for(int j=1;j<n;j+=m)
         if(!check_squre(i,j,m))
        {
            flag=1;break;
        }
        printf("%s\n",flag?"No":"Yes");
    }
    return 0;
}