Battle City
来源:互联网 发布:人口会拖垮印度吗 知乎 编辑:程序博客网 时间:2024/04/30 13:34
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?
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 4
YBEB
EERE
SSTE
0 0
Sample Output
8
题解
#include<cstdio>#include<cstring>#include<queue>#define MAX_N 302#define INF 0x3f3f3f3fusing namespace std;int ox[]={0,0,-1,1};int oy[]={1,-1,0,0};char map[MAX_N][MAX_N];int dp[MAX_N][MAX_N];int M,N;int bfs(){ memset(dp,0x3f,sizeof(dp)); queue<pair<int,int> > que; for(int j=0;j<M;j++) for(int k=0;k<N;k++) if(map[j][k]=='Y'){ que.push(make_pair(j,k)); dp[j][k]=0; break; } int J,K; for(J=0;J<M;J++){ for(K=0;K<N;K++) if(map[J][K]=='T') break; if(map[J][K]=='T') break; } map[J][K]='E'; while(!que.empty()){ int Y=que.front().first,X=que.front().second;que.pop(); int S=dp[Y][X]+1; for(int i=0;i<4;i++){ int y=Y+oy[i]; int x=X+ox[i]; if(0<=y&&y<M&&0<=x&&x<N&&(map[y][x]=='E'||map[y][x]=='B')){ int r=map[y][x]=='B'?1:0; if(dp[y][x]<=r+S) continue; dp[y][x]=r+S; que.push(make_pair(y,x)); } } } return dp[J][K]==INF?-1:dp[J][K];}int main(){ while(~scanf("%d%d",&M,&N)&&M&&N){ for(int i=0;i<M;i++) scanf("%s",map[i]); printf("%d\n",bfs()); } return 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
- Angular 2 中的组件(二)
- pycharm的自定义python模板
- BP神经网络和感知器有什么区别?
- Android程序员看世界--人工智能AI(1)
- 13.2 任务调度和异步执行器
- Battle City
- [BZOJ3669][UOJ#3][Noi2014][LCT]魔法森林
- composer配置中国镜像
- P1093 奖学金
- 如何让你的fedora25的php7支持mysql?
- 循环单链表的基本操作
- 1034.Head of a Gang (30)
- 资产应该也就是我们家的十几倍吧
- CCF201509-4 高速公路(100分)