POJ 3050:Hopscotch
来源:互联网 发布:windows xp源代码 编辑:程序博客网 时间:2024/05/08 18:12
Hopscotch
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2506 Accepted: 1784
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.
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 11 1 1 1 11 1 1 1 11 1 1 2 11 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.
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的矩阵,你可以从任意一个起点走5步,每一步可以上下左右那么走,记录你走过的路径,即你脚下的位置的value,输出不同的路径个数。
自己想输出不同的值,用的vector。。。结果一看其他人用的set比我的方便好多,而且直接insert啊,set自动去重啊。
代码:
#include <iostream>#include <algorithm>#include <cmath>#include <vector>#include <string>#include <cstring>#include <queue>#pragma warning(disable:4996)using namespace std;int value[7][7];vector<int>road;void dfs(int i,int j,int step,int test){if(step==6){test = test*10+value[i][j];road.push_back(test);return;}test = test*10+value[i][j];if(i>1){dfs(i-1,j,step+1,test);}if(j>1){dfs(i,j-1,step+1,test);}if(i<5){dfs(i+1,j,step+1,test);}if(j<5){dfs(i,j+1,step+1,test);}}int main(){int i,j;for(i=1;i<=5;i++){for(j=1;j<=5;j++){cin>>value[i][j];}}for(i=1;i<=5;i++){for(j=1;j<=5;j++){dfs(i,j,1,0);}}sort(road.begin(), road.end());vector<int>::iterator iter =unique(road.begin(),road.end());road.erase(iter,road.end());cout<<road.size()<<endl;return 0;}
0 0
- POJ 3050 Hopscotch
- poj 3050 Hopscotch DFS
- poj 3050 Hopscotch
- POJ-3050-Hopscotch
- poj 3050 Hopscotch
- POJ 3050 Hopscotch 水~
- POJ 3050 Hopscotch
- POJ-3050 Hopscotch
- POJ 3050 Hopscotch DFS
- POJ 3050 Hopscotch
- POJ 3050 Hopscotch
- poj 3050 Hopscotch 【DFS】
- poj 3050 Hopscotch
- Hopscotch (poj 3050 dfs)
- POJ 3050 Hopscotch
- Hopscotch.(POJ-3050)
- Hopscotch - POJ 3050 DFS
- POJ 3050 Hopscotch
- Oprofile:CPU性能分析工具指南
- android聊天的时候让listview最新消息自动滚动到可视范围之内
- SQL语句
- struts2命名空间namespace和访问路径的关系
- c/c++中运行外部程序
- POJ 3050:Hopscotch
- HDU 1394 Minimum Inversion Number (线段数)
- 【线段树】 HDOJ 5338 ZZX and Permutations
- 架构设计和概要设计
- 【English】1507 暑假的英语快照
- 分页控件
- mips平台下gdb制作
- Add Two Numbers
- NYOJ 47 过河问题 (贪心)