搜索hdu 1240
来源:互联网 发布:天猫国际 化妆品 知乎 编辑:程序博客网 时间:2024/05/22 00:47
Problem I
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 16 Accepted Submission(s) : 11
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
Problem Description
You're in space.
You want to get home.
There are asteroids.
You don't want to hit them.
You want to get home.
There are asteroids.
You don't want to hit them.
Input
Input to this problem will consist of a (non-empty) series of up to 100 data sets. Each data set will be formatted according to the following description, and there will be no blank lines separating data sets.
A single data set has 5 components:
Start line - A single line, "START N", where 1 <= N <= 10.
Slice list - A series of N slices. Each slice is an N x N matrix representing a horizontal slice through the asteroid field. Each position in the matrix will be one of two values:
'O' - (the letter "oh") Empty space
'X' - (upper-case) Asteroid present
Starting Position - A single line, "A B C", denoting the <A,B,C> coordinates of your craft's starting position. The coordinate values will be integers separated by individual spaces.
Target Position - A single line, "D E F", denoting the <D,E,F> coordinates of your target's position. The coordinate values will be integers separated by individual spaces.
End line - A single line, "END"
The origin of the coordinate system is <0,0,0>. Therefore, each component of each coordinate vector will be an integer between 0 and N-1, inclusive.
The first coordinate in a set indicates the column. Left column = 0.
The second coordinate in a set indicates the row. Top row = 0.
The third coordinate in a set indicates the slice. First slice = 0.
Both the Starting Position and the Target Position will be in empty space.
A single data set has 5 components:
Start line - A single line, "START N", where 1 <= N <= 10.
Slice list - A series of N slices. Each slice is an N x N matrix representing a horizontal slice through the asteroid field. Each position in the matrix will be one of two values:
'O' - (the letter "oh") Empty space
'X' - (upper-case) Asteroid present
Starting Position - A single line, "A B C", denoting the <A,B,C> coordinates of your craft's starting position. The coordinate values will be integers separated by individual spaces.
Target Position - A single line, "D E F", denoting the <D,E,F> coordinates of your target's position. The coordinate values will be integers separated by individual spaces.
End line - A single line, "END"
The origin of the coordinate system is <0,0,0>. Therefore, each component of each coordinate vector will be an integer between 0 and N-1, inclusive.
The first coordinate in a set indicates the column. Left column = 0.
The second coordinate in a set indicates the row. Top row = 0.
The third coordinate in a set indicates the slice. First slice = 0.
Both the Starting Position and the Target Position will be in empty space.
Output
For each data set, there will be exactly one output set, and there will be no blank lines separating output sets.
A single output set consists of a single line. If a route exists, the line will be in the format "X Y", where X is the same as N from the corresponding input data set and Y is the least number of moves necessary to get your ship from the starting position to the target position. If there is no route from the starting position to the target position, the line will be "NO ROUTE" instead.
A move can only be in one of the six basic directions: up, down, left, right, forward, back. Phrased more precisely, a move will either increment or decrement a single component of your current position vector by 1.
A single output set consists of a single line. If a route exists, the line will be in the format "X Y", where X is the same as N from the corresponding input data set and Y is the least number of moves necessary to get your ship from the starting position to the target position. If there is no route from the starting position to the target position, the line will be "NO ROUTE" instead.
A move can only be in one of the six basic directions: up, down, left, right, forward, back. Phrased more precisely, a move will either increment or decrement a single component of your current position vector by 1.
Sample Input
START 1O0 0 00 0 0ENDSTART 3XXXXXXXXXOOOOOOOOOXXXXXXXXX0 0 12 2 1ENDSTART 5OOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOXXXXXXXXXXXXXXXXXXXXXXXXXOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO0 0 04 4 4END
Sample Output
1 03 4NO ROUTE
Statistic | Submit | Back
网址:http://acm.hdu.edu.cn/showproblem.php?pid=1240
原本用sum记录走的步数不知为什么搓了 后来想起了昨天的那道用b[x][y][z]记录居然A了....
***************************************************************************************
代码:#include<stdio.h>#include<string.h>char a[15][15][15];int b[15][15][15];int n,x1,x2,y1,y2,z1,z2;int xii[]={0,0,0,0,-1,1};int yii[]={0,0,-1,1,0,0};int zii[]={1,-1,0,0,0,0};struct Node{int x, y, z ;int step;}aaa[10001];int bfs(){int c,d,xi,yi,zi,i;c=0;d=1;memset(b,0,sizeof(b));aaa[0].x=x1;aaa[0].y=y1;aaa[0].z=z1;b[x1][y1][z1]=0;while(c<d){a[aaa[c].x][aaa[c].y][aaa[c].z]='X';if(aaa[c].x==x2&&aaa[c].y==y2&&aaa[c].z==z2){return 1;}for(i=0;i<6;i++){xi=aaa[c].x+xii[i];yi=aaa[c].y+yii[i];zi=aaa[c].z+zii[i];if(xi==x2&&yi==y2&&zi==z2){b[xi][yi][zi]=b[aaa[c].x][aaa[c].y][aaa[c].z]+1;return 1;}if(xi<0||xi>=n||yi<0||yi>=n||zi<0||zi>=n){continue;}if(a[xi][yi][zi]=='X'){continue;}else {b[xi][yi][zi]=b[aaa[c].x][aaa[c].y][aaa[c].z]+1;aaa[d].x=xi;aaa[d].y=yi;aaa[d].z=zi;d++;}}c++;}return 0;}int main(){char hhhh[10],yyyy[10];int i,j;while(~scanf("%s %d",hhhh,&n)){memset(a,0,sizeof(a));for(i=0;i<n;i++)for(j=0;j<n;j++){scanf("%s",a[i][j]);}scanf("%d%d%d%d%d%d",&x1,&y1,&z1,&x2,&y2,&z2);scanf("%s",yyyy);if(bfs())printf("%d %d\n",n,b[x2][y2][z2]);else printf("NO ROUTE\n");}return 0;}/*fd 2000000000 0 01 1 1eewrfs 20X0X0X0X0 0 01 1 1dffg*/
- 搜索hdu 1240
- hdu 1240 Asteroids!(搜索)
- HDU 1240 Asteroids! (搜索)
- hdu搜索
- hdu搜索
- hdu 1240 深度优先搜索+剪枝(记忆化搜索)
- hdu 1240 Asteroids!(三维搜索)
- BFS--- HDU 1240 Asteroids! 广度优先搜索
- HDU 1704 (搜索题)
- HDU 4016 搜索
- HDU 1181 搜索
- HDU-1128 暴力搜索
- 搜索 hdu 1238
- hdu 3786 搜索
- HDU 1430 魔板 搜索
- HDU-1548(BFS搜索)
- HDU 4536 状态搜索
- hdu 2141 二分搜索
- JSON入门指南
- 《Effective C++》读书笔记之item28:避免返回handles指向对象内部成分
- POJ-2187-凸包
- Linux Cp和MV
- (一)C++启航
- 搜索hdu 1240
- poj 3468 A Simple Problem with Integers(线段树#6 / 树状数组)
- Struts2与Struts1的不同
- finally
- [MapReduce编程]用MapReduce大刀砍掉海量数据离线处理问题。
- javascript获取html标签的实例
- ATIchinapay银联支付模块.zip
- rpm包管理详解
- linux bashl学习(二) shell基础知识-番外篇