poj 3050 Hopscotch（暴力+dfs）

Description

The cows play the child's game of hopscotch in a non-traditional way. Instead of a linear set of numbered boxes into which to hop, the cows create a 5x5 rectilinear grid of digits parallel to the x and y axes. 

They then adroitly hop onto any digit in the grid and hop forward, backward, right, or left (never diagonally) to another digit in the grid. They hop again (same rules) to a digit (potentially a digit already visited). 

With a total of five intra-grid hops, their hops create a six-digit integer (which might have leading zeroes like 000201). 

Determine the count of the number of distinct integers that can be created in this manner.

Input

* Lines 1..5: The grid, five integers per line

Output

* Line 1: The number of distinct integers that can be constructed

Sample Input

1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
1 1 1 2 1
1 1 1 1 1

Sample Output

15

Hint

OUTPUT DETAILS: 
111111, 111112, 111121, 111211, 111212, 112111, 112121, 121111, 121112, 121211, 121212, 211111, 211121, 212111, and 212121 can be constructed. No other values are possible.

题意：从一点开始往上下左右进行跳跃5次，问最后能得到多少个不同的六位数。

思路：从数组的不同点进行dfs，当搜了6次且此时ans的bool值为0，把其变为1，tmp++，打印最后tmp的值。

AC代码：

#include <iostream>
#include<cstdio>
#include <cstring>
#include <queue>
#include<map>
#include<algorithm>
using namespace std;
bool mp[1000000];
int a[5][5],t[4][2]= {{1,0},{-1,0},{0,1},{0,-1}};
int ans;
int tmp;
void dfs(int x,int y,int dep)
{
    int tx,ty;
    ans=ans*10+a[x][y];
    if(dep==6)
    {
        if(!mp[ans])
        {
            mp[ans]=1;
            tmp++;
        }
        return ;
    }
    for(int i=0; i<4; i++)
    {
        tx=x+t[i][0],ty=y+t[i][1];
        if(tx<0||ty<0||tx>=5||ty>=5)
            continue;
        else
        {
            dfs(tx,ty,dep+1);
            ans=ans/10;
        }
    }
}
int main()
{
    for(int i=0; i<5; i++)
        for(int j=0; j<5; j++)
            scanf("%d",&a[i][j]);
    tmp=0;
    for(int i=0; i<5; i++)
        for(int j=0; j<5; j++)
        {
                ans=0;
                dfs(i,j,1);
        }
    printf("%d\n",tmp);
    return 0;
}