POJ 3050 Hopscotch 暴力 DFS

DFS枚举每个点开始的全部长度为6的数字串，插入到set里面。

//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<sstream>
#include<cmath>
#include<climits>
#include<string>
#include<map>
#include<queue>
#include<vector>
#include<stack>
#include<set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
#define pb(a) push(a)
#define INF 0x1f1f1f1f
#define lson idx<<1,l,mid
#define rson idx<<1|1,mid+1,r
#define PI  3.1415926535898
template<class T> T min(const T& a,const T& b,const T& c) {
    return min(min(a,b),min(a,c));
}
template<class T> T max(const T& a,const T& b,const T& c) {
    return max(max(a,b),max(a,c));
}
void debug() {
#ifdef ONLINE_JUDGE
#else

    freopen("in.txt","r",stdin);
    //freopen("d:\out1.txt","w",stdout);
#endif
}
int getch() {
    int ch;
    while((ch=getchar())!=EOF) {
        if(ch!=' '&&ch!='
')return ch;
    }
    return EOF;
}

struct Node
{
    int a[6];
    bool operator < (const Node &ant) const
    {
        int i=0;
        while(i<6&&a[i]==ant.a[i])i++;
        return i<6&&a[i]<ant.a[i];
    }
};
int g[6][6];
set<Node> se;
Node ans;
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
void dfs(int x,int y,int t)
{
    ans.a[t-1]=g[x][y];
    if(t==6)
        se.insert(ans);
    else
    {
        for(int d=0;d<4;d++)
        {
            int nx=x+dx[d];
            int ny=y+dy[d];
            if(nx>=1&&nx<=5&&ny>=1&&ny<=5)
                dfs(nx,ny,t+1);
        }
    }
}

int main()
{
    for(int i=1;i<=5;i++)
        for(int j=1;j<=5;j++)
            scanf("%d",&g[i][j]);
    for(int i=1;i<=5;i++)
        for(int j=1;j<=5;j++)
            dfs(i,j,1);
    printf("%d
",se.size());
    return 0;
}