BZOJ3109: [cqoi2013]新数独

题目：http://www.lydsy.com/JudgeOnline/problem.php?id=3109

搜索一遍。读入注意一下。。

#include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#define rep(i,l,r) for (int i=l;i<=r;i++)
#define down(i,l,r) for (int i=l;i>=r;i--)
#define clr(x,y) memset(x,y,sizeof(x))
#define maxn 1000500
using namespace std;
bool bx[][],by[][],bz[][][];
int mpd[][],mpr[][],mp[][],chx[],chy[];
int cnt1,cnt2,flag;
char ch;
int read(){
    int x=,f=; char ch=getchar();
    while (!isdigit(ch)) {if (ch=='-') f=-; ch=getchar();}
    while (isdigit(ch)) {x=x*+ch-''; ch=getchar();}
    return x*f;
}
bool jud(int x,int y,int val){
    if (bx[x][val]||by[y][val]||bz[(x-)/][(y-)/][val]) return ;
    if (mpr[x][y-]!=) {
        if (mpr[x][y-]==&&mp[x][y-]<val) return ;
        if (mpr[x][y-]==-&&mp[x][y-]>val) return ;
    }
    if (mpd[x-][y]!=){
        if (mpd[x-][y]==&&mp[x-][y]<val) return ;
        if (mpd[x-][y]==-&&mp[x-][y]>val) return ;
    }
    return ;
}
void print(){
    rep(i,,) {
        rep(j,,) printf("%d ",mp[i][j]); printf("%d\n",mp[i][]);
    }
}
void dfs(int x,int y){
    if (x==) {flag=; print(); return;}
    if (flag) return;
    rep(i,,) if (jud(x,y,i)) {
        bx[x][i]=; by[y][i]=; bz[(x-)/][(y-)/][i]=;
        mp[x][y]=i;
        if (y==) dfs(x+,); else dfs(x,y+);
        bx[x][i]=; by[y][i]=; bz[(x-)/][(y-)/][i]=;
    }
}
int main(){
  //freopen("in.txt","r",stdin);
    rep(t,,){
        cnt1=cnt2=;
        rep(i,,){
            if (i&){
                cnt1++;
                rep(j,,) {
                    ch=getchar();
                    while (ch!='<'&&ch!='>') ch=getchar();
                    if (ch=='<') chx[j]=-; else chx[j]=;
                }
            //  rep(j,1,6) printf("%d ",chx[j]); puts("");
                rep(j,,)
                    rep(k,,)
                        mpr[cnt1+t*][k+j*]=chx[j*+k];//,printf("%d %d %d\n",cnt1+t*3,k+j*3,mpr[cnt1+t*3][k+j*3]);
            }
            else {
                cnt2++;
                rep(j,,) {
                    ch=getchar();
                    while (ch!='v'&&ch!='^') ch=getchar();
                    if (ch=='v') chy[j]=; else chy[j]=-;
                }
                rep(j,,) rep(k,,) mpd[cnt2+t*][k+j*]=chy[j*+k];//,printf("%d %d %d\n",cnt2+t*3,k+j*3,mpd[cnt2+t*3][k+j*3]);
            }
        }
    }
    dfs(,);
    return ;
}