hdu 4308 Saving Princess claire_(bfs,4级)
来源:互联网 发布:数据挖掘的作用 编辑:程序博客网 时间:2024/05/22 03:17
Saving Princess claire_
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1497 Accepted Submission(s): 559
Problem Description
Princess claire_ was jailed in a maze by Grand Demon Monster(GDM) teoy.
Out of anger, little Prince ykwd decides to break into the maze to rescue his lovely Princess.
The maze can be described as a matrix of r rows and c columns, with grids, such as 'Y', 'C', '*', '#' and 'P', in it. Every grid is connected with its up, down, left and right grids.
There is only one 'Y' which means the initial position when Prince ykwd breaks into the maze.
There is only one 'C' which means the position where Princess claire_ is jailed.
There may be many '*'s in the maze, representing the corresponding grid can be passed through with a cost of certain amount of money, as GDM teoy has set a toll station.
The grid represented by '#' means that you can not pass it.
It is said that as GDM teoy likes to pee and shit everywhere, this grid is unfortunately damaged by his ugly behavior.
'P' means it is a transmission port and there may be some in the maze. These ports( if exist) are connected with each other and Prince ykwd can jump from one of them to another.
They say that there used to be some toll stations, but they exploded(surely they didn't exist any more) because of GDM teoy's savage act(pee and shit!), thus some wormholes turned into existence and you know the following things. Remember, Prince ykwd has his mysterious power that he can choose his way among the wormholes, even he can choose to ignore the wormholes.
Although Prince ykwd deeply loves Princess claire_, he is so mean that he doesn't want to spend too much of his money in the maze. Then he turns up to you, the Great Worker who loves moving bricks, for help and he hopes you can calculate the minimum money he needs to take his princess back.
Out of anger, little Prince ykwd decides to break into the maze to rescue his lovely Princess.
The maze can be described as a matrix of r rows and c columns, with grids, such as 'Y', 'C', '*', '#' and 'P', in it. Every grid is connected with its up, down, left and right grids.
There is only one 'Y' which means the initial position when Prince ykwd breaks into the maze.
There is only one 'C' which means the position where Princess claire_ is jailed.
There may be many '*'s in the maze, representing the corresponding grid can be passed through with a cost of certain amount of money, as GDM teoy has set a toll station.
The grid represented by '#' means that you can not pass it.
It is said that as GDM teoy likes to pee and shit everywhere, this grid is unfortunately damaged by his ugly behavior.
'P' means it is a transmission port and there may be some in the maze. These ports( if exist) are connected with each other and Prince ykwd can jump from one of them to another.
They say that there used to be some toll stations, but they exploded(surely they didn't exist any more) because of GDM teoy's savage act(pee and shit!), thus some wormholes turned into existence and you know the following things. Remember, Prince ykwd has his mysterious power that he can choose his way among the wormholes, even he can choose to ignore the wormholes.
Although Prince ykwd deeply loves Princess claire_, he is so mean that he doesn't want to spend too much of his money in the maze. Then he turns up to you, the Great Worker who loves moving bricks, for help and he hopes you can calculate the minimum money he needs to take his princess back.
Input
Multiple cases.(No more than fifty.)
The 1st line contains 3 integers, r, c and cost. 'r', 'c' and 'cost' is as described above.(0 < r * c <= 5000 and money is in the range of (0, 10000] )
Then an r * c character matrix with 'P' no more than 10% of the number of all grids and we promise there will be no toll stations where the prince and princess exist.
The 1st line contains 3 integers, r, c and cost. 'r', 'c' and 'cost' is as described above.(0 < r * c <= 5000 and money is in the range of (0, 10000] )
Then an r * c character matrix with 'P' no more than 10% of the number of all grids and we promise there will be no toll stations where the prince and princess exist.
Output
One line with an integer, representing the minimum cost. If Prince ykwd cannot rescue his princess whatever he does, then output "Damn teoy!".(See the sample for details.)
Sample Input
1 3 3Y*C1 3 2Y#C1 5 2YP#PC
Sample Output
3Damn teoy!0
Author
BUPT
Source
2012 Multi-University Training Contest 1
Recommend
zhuyuanchen520
思路:BFS,搜y->c结束,y->p 就将所有的P压入栈。
容易爆内存,最好不要自己写循环队列
#include<iostream>#include<cstring>#include<cstdio>#include<queue>#include<algorithm>using namespace std;const int mm=5005;const int oo=1e9;const int dx[]={1,-1,0,0};const int dy[]={0,0,1,-1};char s[mm][mm];bool vis[mm][mm];int r,c,cost;int ans;class node{public:int x,y,step;}ss,ee,f[mm];int pos;queue<node>q;void bfs(){ while(!q.empty())q.pop(); node z,t;q.push(ss); memset(vis,0,sizeof(vis)); vis[ss.x][ss.y]=1; while(!q.empty()) { z=q.front();q.pop(); for(int i=0;i<4;++i) { t.x=z.x+dx[i];t.y=z.y+dy[i];t.step=z.step; if(t.x<0||t.x>=r||t.y<0||t.y>=c||vis[t.x][t.y]||s[t.x][t.y]=='#')continue; vis[t.x][t.y]=1; if(s[t.x][t.y]=='C'){ans=t.step;return;} if(s[t.x][t.y]=='P') { for(int j=0;j<pos;++j) {f[j].step=z.step;q.push(f[j]);vis[f[j].x][f[j].y]=1; } } if(s[t.x][t.y]=='*') ++t.step; q.push(t); } }}int main(){ while(~scanf("%d%d%d",&r,&c,&cost)) {pos=0;ans=oo; for(int i=0;i<r;++i) scanf("%s",s[i]); for(int i=0;i<r;++i) for(int j=0;j<c;++j) if(s[i][j]=='Y')ss.x=i,ss.y=j,ss.step=0; else if(s[i][j]=='C')ee.x=i,ee.y=j,ee.step=0; else if(s[i][j]=='P')f[pos].x=i,f[pos++].y=j; bfs(); if(ans==oo)printf("Damn teoy!\n"); else {ans*=cost;printf("%d\n",ans);} }}
- hdu 4308 Saving Princess claire_(bfs,4级)
- hdu 4308 Saving Princess claire_(bfs)
- 【BFS】 HDU 4308 Saving Princess claire_
- hdu 4308 Saving Princess claire_(BFS)
- hdu 4308 Saving Princess claire_ BFS
- hdu 4308 Saving Princess claire_
- HDU 4308 Saving Princess claire_
- HDU 4308 - Saving Princess claire_
- HDU 4308 Saving Princess claire_
- HDU 4308 Saving Princess claire_
- hdu 4308 - Saving Princess claire_
- HDU 4308 Saving Princess claire_
- HDU 4308 Saving Princess claire_
- hdu 4308 Saving Princess claire_
- hdu 4308 Saving Princess claire_(BFS+优先队列)
- HDOJ 4308 - Saving Princess claire_ 水BFS...
- HDU/HDOJ----4308 Saving Princess claire_
- HDU4308 Saving Princess claire_ BFS
- 虚函数
- 简单的RPC编程实践——HelloWorld的实现
- Win7下的使用QTP进行猴子测试的性能日志实现方法
- Spring事务配置
- QTP快速入门和简易猴子测试的实现
- hdu 4308 Saving Princess claire_(bfs,4级)
- epoll学习和回显服务器实现(C语言版)
- Linux编译内核实验小结
- 网络编程之应用
- 利用模块添加系统调用(不重新编译内核)
- 通过对inode的修改对文件操作进行扩充
- 再读Socket编程——《UNIX网络编程(卷一)》学习点滴
- 内核线程的创建、使用和退出;关于延时宏的补充说明
- 内核线程优先级的设置