POJ2312 Battle City(优先队列+广搜BFS)
来源:互联网 发布:使徒行者2 知乎 编辑:程序博客网 时间:2024/06/06 09:13
题目:
Battle City
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8495 Accepted: 2847
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
Source
POJ Monthly,鲁小石
[Submit] [Go Back] [Status] [Discuss]
代码:思路:看注释
//注意 Y代表起点,T代表终点。B、E可以走,S、R不可以走,B的时间花费为2,E为1.#include <stdio.h>#include <queue>#include <string.h>#include <algorithm>#define mem(a,b) memset(a,b,sizeof(a))using namespace std;int go[4][2]= {{1,0},{-1,0},{0,1},{0,-1}};int m,n;char map[301][301];int vis[301][301];int x1,x2,y1,y2;struct node{ int x,y,s; friend bool operator < (node a,node b) { return a.s>b.s;//重载运算符,步数从小到大排列 }};int bfs(int x,int y){ node now,to; now.x=x,now.y=y,now.s=0; priority_queue<node>q; q.push(now); vis[x][y]=1; while(!q.empty()) { now=q.top(); if(map[now.x][now.y]=='T') return now.s;//满足条件,返回步数 q.pop(); for(int i=0; i<4; i++) { int xx=now.x+go[i][0]; int yy=now.y+go[i][1]; if(xx>=0&&xx<m&&yy>=0&&yy<n&&map[xx][yy]!='R'&&map[xx][yy]!='S'&&vis[xx][yy]==0)//判断是否越界 { to.x=xx; to.y=yy; to.s=now.s+1; if(map[to.x][to.y]=='B') to.s++; vis[to.x][to.y]=1; q.push(to); } } } return 0;}int main(){ while(~scanf("%d%d",&m,&n)&&m&&n) { for(int i=0; i<m; i++) { scanf("%s",map[i]); for(int j=0; j<n; j++) { if(map[i][j]=='Y') { x1=i; y1=j; } } } mem(vis,0); int aa=bfs(x1,y1); if(aa) printf("%d\n",aa); else printf("-1\n"); } return 0;}
0 0
- POJ2312 Battle City(优先队列+广搜BFS)
- poj2312 battle city 优先队列+bfs
- 广搜与优先队列-----POJ2312
- poj2312 BFS+优先队列
- poj2312优先队列BFS
- POJ 2312 Battle City 优先队列+BFS
- 【BFS+优先队列】Battle City(poj-2312)
- poj 2312 Battle City bfs +优先队列
- POJ 2312 Battle City 优先队列+BFS
- POJ 2312 Battle City(优先队列 + BFS)
- POJ 2312 Battle City(优先队列+BFS)
- POJ 2312 Battle City BFS+优先队列
- poj 2312 Battle City(优先队列+bfs)
- POJ 2312:Battle City【BFS & 优先队列】
- poj 2312 Battle City(优先队列+bfs)
- POJ 2312 Battle City【Bfs+优先队列】
- POJ 2312 Battle City 优先队列+bfs
- Battle City (BFS+优先队列)
- struts2通过文件流将图片文件显示在页面中
- eclipse_j2ee配置Tomcat
- JQuery实现点击div里面的元素能触发点击事件,但是不触发外面的div的点击事件
- 1207
- jsp入门
- POJ2312 Battle City(优先队列+广搜BFS)
- a href=#与 a href=javascript:void(0) 的区别
- 新环境配置编译chromium
- coursera算法公开课练习题Interview(1)
- IDA6.1下载符号表时卡死
- 学习python的第二十九天-函数,变量,global语句
- 统计学资料
- Java远程调用BPS流程实现流程运行简单示例
- 按列合并txt文件