POJ2044[Deep search]

State with int storage, but to use bit operation, so the code is simple and many.
Code:

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#define fr(i,a,b) for(int i=(a),i_end=(b);i<=i_end;i++)
#define frd(i,a,b) for(int i=(a),i_end=(b);i>=i_end;i--)
#define ll long long
#define pri(x) printf("%d",x);
#define mes(x) memset(x,0,sizeof(x))
#define prin(x) printf("%d\n",x);
using namespace std;
int mx[9]={0,1,2,-1,-2,0,0,0,0};
int my[9]={0,0,0,0,0,1,2,-1,-2};
int f[8][8][8][8][10][370],d[370],n;
int dfs(int x,int y,int s,int *a){
    if(s==n)return 1;
    if(a[1]==7||a[2]==7||a[3]==7||a[4]==7)return 0;
    int _=3*x+y;
    if(f[a[1]][a[2]][a[3]][a[4]][_][s])return 0;
    f[a[1]][a[2]][a[3]][a[4]][_][s]=1;
    _=(1<<(15-4*x-y))|(1<<(14-4*x-y))|(1<<(11-4*x-y))|(1<<(10-4*x-y));
    if(d[s]&_)return 0;
    fr(i,0,8){
        int _x=x+mx[i];
        int _y=y+my[i];
        if(_x<0||_x>2||_y<0||_y>2)continue;
        int _[5];
        fr(j,1,4)
            _[j]=a[j]+1;
        if(_x==0&&_y==0)_[1]=0;
        if(_y==0&&_x==2)_[3]=0;
        if(_x==0&&_y==2)_[2]=0;
        if(_x==2&&_y==2)_[4]=0;
        if(dfs(_x,_y,s+1,_))return 1;
    }
    return 0;
}
int main(){
    while(scanf("%d",&n)&&n){
        mes(d);
        mes(f);
        fr(i,0,n-1)
            fr(j,1,16){
                int _;
                scanf("%d",&_);
                d[i]=(d[i]<<1)|_;
            }
        int __[5]={0,1,1,1,1};
        prin(dfs(1,1,0,__));
    }
    return 0;
}