Hopscotch（POJ 3050 DFS）

提示：扫一扫查出行
【扫一扫了解最新限行尾号】
复制提示

Hopscotch

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 2845		Accepted: 1995

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

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.

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <set>
#include <cstring>
using namespace std;
int a[][];
int n;
int vis[][];
int dx[]={,,-,},dy[]={-,,,};
set<int> se;
int dfs(int x,int y,int s,int num)
{
if(s==)
{
//cout<<num<<endl;
se.insert(num);
return ;
}
for(int i=;i<;i++)
{
int nx=x+dx[i];
int ny=y+dy[i];
if(nx>=&&ny>=&&nx<=&&ny<=&&vis[nx][ny]==)
{
// vis[nx][ny]=1;
dfs(nx,ny,s+,num*+a[nx][ny]);
// vis[nx][ny]=0;
}
}
return ;
}
int main()
{
int i,j;
freopen("in.txt","r",stdin);
memset(vis,,sizeof(vis));
for(i=;i<;i++)
for(j=;j<;j++)
scanf("%d",&a[i][j]);
for(i=;i<;i++)
for(j=;j<;j++)
{
//vis[i][j]=1;
dfs(i,j,,a[i][j]);
//vis[i][j]=0;
}
printf("%d\n",se.size());
// set<int>::iterator a=se.begin();
/*for(;a!=se.end();a++)
{
cout<<*a<<endl;
}*/
}