首页 > 代码库 > poj 3050 Hopscotch【搜索、去重】

poj 3050 Hopscotch【搜索、去重】

2024-08-04 13:20:28   221人阅读

点击打开题目

Hopscotch
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 2126 Accepted: 1524

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*5的矩阵，每一点都有一个数字，让你分别从任意一个数字出发，向上下左右移动，移动6次，所走的路线组成一个字符串，

求：一共可以组成多少个不同的字符串？


结题思路：从每一个点开始搜索，把每走六步的字符串转化成数字放到set里面，至于去重，交给神奇的set吧！


#include<iostream>
#include<cstdio>
#include<set>
using namespace std;
int a[6][6],s[][2]={1,0,-1,0,0,1,0,-1};
set<int>p;
void dfs(int i,int j,int v,int num){
    if(v==6){
        p.insert(num);
        return ;
    }
    if(i<1||j<1||i>5||j>5)return ;
    else{
        for(int k=0;k<4;k++)
            dfs(i+s[k][0],j+s[k][1],v+1,num*10+a[i][j]);
    }
}
int main()
{
    int i,j;
    for(i=1;i<6;i++)
        for(j=1;j<6;j++)
            scanf("%d",&a[i][j]);
    for(i=1;i<6;i++)
        for(j=1;j<6;j++)
            dfs(i,j,0,0);
    printf("%d\n",p.size());
    return 0;
}



poj 3050 Hopscotch【搜索、去重】


联系
我们