Battle City
来源:互联网 发布:p2p 节点 发现 算法 编辑:程序博客网 时间:2024/04/30 14:55
Description
Many of us had played the game "Battle city" in our childhood, and some people (like me) even often play it on computer now.
What we are discussing is a simple edition of this game. Given a map that consists of empty spaces, rivers, steel walls and brick walls only. Your task is to get a bonus as soon as possible suppose that no enemies will disturb you (See the following picture).
Your tank can't move through rivers or walls, but it can destroy brick walls by shooting. A brick wall will be turned into empty spaces when you hit it, however, if your shot hit a steel wall, there will be no damage to the wall. In each of your turns, you can choose to move to a neighboring (4 directions, not 8) empty space, or shoot in one of the four directions without a move. The shot will go ahead in that direction, until it go out of the map or hit a wall. If the shot hits a brick wall, the wall will disappear (i.e., in this turn). Well, given the description of a map, the positions of your tank and the target, how many turns will you take at least to arrive there?
What we are discussing is a simple edition of this game. Given a map that consists of empty spaces, rivers, steel walls and brick walls only. Your task is to get a bonus as soon as possible suppose that no enemies will disturb you (See the following picture).
Your tank can't move through rivers or walls, but it can destroy brick walls by shooting. A brick wall will be turned into empty spaces when you hit it, however, if your shot hit a steel wall, there will be no damage to the wall. In each of your turns, you can choose to move to a neighboring (4 directions, not 8) empty space, or shoot in one of the four directions without a move. The shot will go ahead in that direction, until it go out of the map or hit a wall. If the shot hits a brick wall, the wall will disappear (i.e., in this turn). Well, given the description of a map, the positions of your tank and the target, how many turns will you take at least to arrive there?
Input
The input consists of several test cases. The first line of each test case contains two integers M and N (2 <= M, N <= 300). Each of the following M lines contains N uppercase letters, each of which is one of 'Y' (you), 'T' (target), 'S' (steel wall), 'B' (brick wall), 'R' (river) and 'E' (empty space). Both 'Y' and 'T' appear only once. A test case of M = N = 0 indicates the end of input, and should not be processed.
Output
For each test case, please output the turns you take at least in a separate line. If you can't arrive at the target, output "-1" instead.
Sample Input
3 4YBEBEERESSTE0 0
Sample Output
8
题意就是空地的话就需要一分钟 如果是墙就需要2分钟 只要用优先队列枚举最小值遍历就能过了
<pre class="cpp" name="code">#include <iostream>#include <queue>#include <cstdio>#include <cstring>using namespace std;#define max 301char map[max][max];int n,m;int vist[max][max];int d[4][2]= {{1,0},{0,1},{-1,0},{0,-1}};struct node{ int x,y,c; friend bool operator <(const node &s1,const node &s2) { return s1.c>s2.c; }};node s,e;int bfs(){ priority_queue < node > q; memset(vist,0,sizeof(vist)); node now,t; s.c=0; q.push(s); vist[s.x][s.y]=1; while (!q.empty()) { now=q.top(); q.pop(); if (now.x==e.x&&now.y==e.y) { return now.c; } for (int i=0; i<4; i++) { t.x=now.x+d[i][0]; t.y=now.y+d[i][1]; if (t.x>=0&&t.x<n&&t.y>=0&&t.y<m&&!vist[t.x][t.y]) { vist[t.x][t.y]=1; if (map[t.x][t.y]=='B') { t.c=now.c+2; q.push(t); } else if (map[t.x][t.y]=='E'||map[t.x][t.y]=='T') { t.c=now.c+1; q.push(t); } } } } return -1;}int main(){ int i,j; while(cin>>n>>m,m+n) { for (i=0; i<n; i++) { for (j=0; j<m; j++) { cin>>map[i][j]; if (map[i][j]=='Y') s.x=i,s.y=j; if (map[i][j]=='T') e.x=i,e.y=j; } } int sum=bfs(); cout<<sum<<endl; } return 0;}
0 0
- battle city
- Battle City
- Battle City
- Battle City
- Battle City
- Battle City
- pku 2312 Battle City
- poj 2312 Battle City
- POJ2312-Battle City
- POJ 2312 Battle City
- POJ 2312 - Battle City
- poj 2312:Battle City
- POJ 2312 Battle City
- POJ_2312_BFS:priority_queue -- Battle City
- POJ 2312 Battle City
- poj 2312 Battle City
- 1013 Battle Over City
- poj 2312 Battle City
- php 制动下载pdf文件
- ls命令
- codeforces 500D - New Year Santa Network (树形DP+组合数学)
- 测试一下
- android 存储 内部存储 外部存储 SD卡
- Battle City
- LA 4287 Proving Equivalences (强连通)
- java中hashmap使用containsKey的问题
- hadoop 复制文件到hdfs报错 could only be replicated to 0 nodes instead of minReplication (=1). There are 0
- jexcel 读写EXCEL
- 解决头文件相互包含问题的方法
- SCRIPT5009: “JSON”未定义
- android中popupwindow弹出后,屏幕背景变成半透明
- C# GridView 给某行或某列绑定点击事件和鼠标事件