acm之搜索题目4
来源:互联网 发布:淘宝数据真实数据 编辑:程序博客网 时间:2024/05/17 06:06
Problem Description
You’re in space.
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
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.
Sample Input
START 1
O
0 0 0
0 0 0
END
START 3
XXX
XXX
XXX
OOO
OOO
OOO
XXX
XXX
XXX
0 0 1
2 2 1
END
START 5
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
XXXXX
XXXXX
XXXXX
XXXXX
XXXXX
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
0 0 0
4 4 4
END
Sample Output
1 0
3 4
NO ROUTE
代码:
#include <string.h>#include <stdio.h>#include <queue>using namespace std;char map[20][20][20];int vis[20][20][20];int n;int sx,sy,sz;int ex,ey,ez;int tx[] = {1,-1,0,0,0,0};int ty[] = {0,0,1,-1,0,0};int tz[] = {0,0,0,0,1,-1};struct node{ int x,y,z,step;};int check(int x,int y,int z){ if(x<0 || y<0 || z<0 || x>=n || y>=n || z>=n || vis[x][y][z] ) return 0; return 1;}int bfs(int x,int y,int z){ int i; queue<node> Q; node a,next; a.x = x; a.y = y; a.z = z; a.step = 0; vis[x][y][z] = 1; Q.push(a); while(!Q.empty()) { a = Q.front(); Q.pop(); if(a.x == ex && a.y == ey && a.z == ez) return a.step; for(i = 0;i<6;i++) { next = a; next.x+=tx[i]; next.y+=ty[i]; next.z+=tz[i]; if(check(next.x,next.y,next.z)) { next.step++; vis[next.x][next.y][next.z] = 1; Q.push(next); } } } return -1;}int main(){ char s[10]; int i,j,k; while(~scanf("%s%d",s,&n)) { for(i = 0;i<n;i++) for(j = 0;j<n;j++) scanf("%s",map[i][j]); scanf("%d%d%d%d%d%d",&sx,&sy,&sz,&ex,&ey,&ez); scanf("%s",s); int ans = bfs(sx,sy,sz); if(ans>=0) printf("%d %d\n",n,ans); else printf("NO ROUTE\n"); } return 0;}
- acm之搜索题目4
- acm之搜索题目1
- acm之搜索题目2
- acm之搜索题目3
- acm之搜索题目5
- acm之搜索题目6
- ACM搜索题目总结
- ACM搜索题目总结
- acm,关于搜索题目
- acm之递归题目4
- acm之母函数题目4
- acm之动态规划题目4
- acm之贪心算法题目4
- acm之pku题目分类
- acm题目之教主系列
- acm之pku题目分类
- ACM题目之泥塑课
- ACM题目之排列序数
- Remove Duplicates from Sorted List
- acm之搜索题目3
- 剑指Offer----面试题29:扩展----数组中第K小的数字
- 聊聊Linux动态链接中的PLT和GOT(2)——延迟重定位
- lua基础(一)
- acm之搜索题目4
- STL容器之优先队列
- 147. Insertion Sort List
- poj 3176 Cow Bowling
- 阿里大数据技术
- java(3)------运算符常用大全
- Mysql日志文件
- JSTL标签不起作用,JSTL标签直接输出表达式
- mysql中MAX()函数MIN()函数