hdu 4740 The Donkey of Gui Zhou

模拟，dfs搜一遍。。。

#include<cstdio>
#include<cstring>
#include<iostream>
#define MAXN 1010
using namespace std;
int n,f1,f2;

int vis1[MAXN][MAXN],vis2[MAXN][MAXN];

int dir[][2]={0,1,1,0,0,-1,-1,0};

void solve(int x1,int y1,int d1,int x2,int y2,int d2){
    vis1[x1][y1]=1;
    vis2[x2][y2]=1;
    //printf("x1 y1,x2 y2:%d %d %d %d\n",x1,y1,x2,y2);
    int ex1,ey1,ex2,ey2;
    if(x1==x2 && y1==y2){
        cout<<x1<<" "<<y1<<endl;
        return ;
    }
    if(f1 && f2){
        cout<<-1<<endl;
        return ;
    }
    if(f1)  ex1=x1,ey1=y1;
    else{
        ex1=x1+dir[d1][0];
        ey1=y1+dir[d1][1];
        if(ex1<0 || ey1<0 || ex1>=n || ey1>=n || vis1[ex1][ey1]==1){

            d1=(d1+1)%4;
            ex1=x1+dir[d1][0];
            ey1=y1+dir[d1][1];
            if(ex1<0 || ey1<0 || ex1>=n || ey1>=n || vis1[ex1][ey1]==1){
                f1=1;
                ex1=x1;
                ey1=y1;
            }
        }
    }
    if(f2)  ex2=x2,ey2=y2;
    else{
        ex2=x2+dir[d2][0];
        ey2=y2+dir[d2][1];
        if(ex2<0 || ey2<0 || ex2>=n || ey2>=n || vis2[ex2][ey2]==1){
            d2=(d2+4-1)%4;
            ex2=x2+dir[d2][0];
            ey2=y2+dir[d2][1];
            if(ex2<0 || ey2<0 || ex2>=n || ey2>=n || vis2[ex2][ey2]==1){
                f2=1;
                ex2=x2;
                ey2=y2;
            }
        }
    }
    solve(ex1,ey1,d1,ex2,ey2,d2);
}

int main(){
    int x1,y1,d1,x2,y2,d2;
    while(cin>>n && n){
        scanf("%d%d%d",&x1,&y1,&d1);
        scanf("%d%d%d",&x2,&y2,&d2);
        memset(vis1,0,sizeof vis1);
        memset(vis2,0,sizeof vis2);
        f1=0;
        f2=0;
        solve(x1,y1,d1,x2,y2,d2);
    }
}