poj 3050 hopscotch
来源:互联网 发布:宽带连接多重网络 编辑:程序博客网 时间:2024/05/17 07:22
果然啊 遇到DFS就不会 要多加练习啊
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</pre>Sample Output
15Hint
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 <cstdio>#define MAX_N 10using namespace std;int graph[MAX_N][MAX_N];bool vis[10000000];int make[6];int dx[4] = {0,0,-1,1};int dy[4] = {-1,1,0,0};int ans = 0;void dfs(int x,int y,int step){ if(step==6) { int num=0; for(int i=0;i<6;i++) { num*=10; num+=make[i]; } if(!vis[num]) { vis[num]=true; ans++; } return; } make[step]=graph[x][y]; for(int i = 0;i < 4;i++) { int nx = x + dx[i]; int ny = y + dy[i]; if(nx >= 0 && nx < 5 && ny >= 0 && ny < 5) { dfs(nx,ny,step+1); } }}int main(){ for(int i = 0;i < 5; i++) { for(int j = 0;j < 5; j++) { scanf("%d",&graph[i][j]); } } for(int i = 0;i < 5; i++) { for(int j = 0;j < 5; j++) { dfs(i,j,0); } } printf("%d\n",ans); return 0;}
#include <iostream>
#include <set>
using namespace std;
const int dx[4]={-1,0,1,0};
const int dy[4]={0,1,0,-1};
int pos[6][6];
set<int> st;
void dfs(int i,int j,int value,int num)
{
if(num==6)
{
st.insert(value);
return;
}
for(int k=1;k<=4;k++)
{
int nx=i+dx[k];
int ny=j+dy[k];
if(nx>=1&&nx<=5&&ny>=1&&ny<=5)
{
num++;
dfs(nx,ny,10*value+pos[nx][ny],num);
num--;
}
}
}
int main()
{
for(int i=1;i<=5;i++)
for(int j=1;j<=5;j++)
cin>>pos[i][j];
for(int i=1;i<=5;i++)
for(int j=1;j<=5;j++)
dfs(i,j,pos[i][j],1);
cout<<st.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
- 4、MongoDB集合里面文档的插入,查找,更新操作
- POJ1502 MPI Maelstrom(最短路径)
- 第三方微信授权登录的iOS代码分析
- 局域网跨机访问WCF服务出错本机访问正常的问题
- CF 251D Two Sets 异或高斯消元找最优解
- poj 3050 hopscotch
- An internal error occurred during: "Initializing Java Tooling". java.lang.NullPointerException
- 例解 autoconf 和 automake 生成 Makefile 文件
- AFNetworking3同步请求另类解决方案(阻塞线程)
- corethink功能模块探索开发(十四)后台编辑按钮
- 【学习笔记】3D图形核心基础精炼版-7:stage3D实战-范例工程1
- 使用hexo在github上搭建博客
- [2] CSS&javascript(基本语法及使用)
- HDOJ 5646-DZY Loves Partition【数学】