POJ 1383 Labyrinth (树的直径)
来源:互联网 发布:windows 辅助技术 编辑:程序博客网 时间:2024/05/29 04:17
Labyrinth
Time Limit: 2000MS Memory Limit: 32768KTotal Submissions: 4237 Accepted: 1591
Description
The northern part of the Pyramid contains a very large and complicated labyrinth. The labyrinth is divided into square blocks, each of them either filled by rock, or free. There is also a little hook on the floor in the center of every free block. The ACM have found that two of the hooks must be connected by a rope that runs through the hooks in every block on the path between the connected ones. When the rope is fastened, a secret door opens. The problem is that we do not know which hooks to connect. That means also that the neccessary length of the rope is unknown. Your task is to determine the maximum length of the rope we could need for a given labyrinth.
Input
The input consists of T test cases. The number of them (T) is given on the first line of the input file. Each test case begins with a line containing two integers C and R (3 <= C,R <= 1000) indicating the number of columns and rows. Then exactly R lines follow, each containing C characters. These characters specify the labyrinth. Each of them is either a hash mark (#) or a period (.). Hash marks represent rocks, periods are free blocks. It is possible to walk between neighbouring blocks only, where neighbouring blocks are blocks sharing a common side. We cannot walk diagonally and we cannot step out of the labyrinth.
The labyrinth is designed in such a way that there is exactly one path between any two free blocks. Consequently, if we find the proper hooks to connect, it is easy to find the right path connecting them.
The labyrinth is designed in such a way that there is exactly one path between any two free blocks. Consequently, if we find the proper hooks to connect, it is easy to find the right path connecting them.
Output
Your program must print exactly one line of output for each test case. The line must contain the sentence "Maximum rope length is X." where Xis the length of the longest path between any two free blocks, measured in blocks.
Sample Input
23 3####.####7 6########.#.####.#.####.#.#.##.....########
Sample Output
Maximum rope length is 0.Maximum rope length is 8.
Hint
Huge input, scanf is recommended.
If you use recursion, maybe stack overflow. and now C++/c 's stack size is larger than G++/gcc
If you use recursion, maybe stack overflow. and now C++/c 's stack size is larger than G++/gcc
Source
Central Europe 1999
用两次BFS。
#include<stdio.h>#include<string.h>#include<queue>#include<algorithm>using namespace std;int dx[]={1,0,-1,0};int dy[]={0,1,0,-1};char map[1100][1100];bool vis[1100][1100];struct node{int from,to,step;};int a,b,ans,n,m;void bfs(int u,int v){queue<node>q;memset(vis,false,sizeof(vis));node now,next,t;ans=0;t.from=u;t.to=v;t.step=1;vis[u][v]=true;q.push(t);while(!q.empty()){now=q.front();ans=now.step;q.pop();for(int i=0;i<4;i++){next.from=now.from+dx[i];next.to=now.to+dy[i];if(next.from>=0&&next.to>=0&&next.from<n&&next.to<m&&map[next.from][next.to]=='.'&&vis[next.from][next.to]==false){next.step=now.step+1;a=next.from;b=next.to;vis[next.from][next.to]=true;q.push(next);}}}}int main(){int t,i,j;int Max;scanf("%d",&t);while(t--){Max=0;scanf("%d%d",&m,&n);for(i=0;i<n;i++)scanf("%s",map[i]);for(i=0;i<n;i++){for(j=0;j<m;j++){if(map[i][j]=='.'){bfs(i,j);bfs(a,b);break;}}if(j<m)//注意 break;}printf("Maximum rope length is %d.\n",ans-1);}return 0; }
0 0
- 【POJ】1383 - Labyrinth(树的直径)
- POJ 1383 Labyrinth (树的直径)
- poj 1383 Labyrinth(树的直径)
- POJ 1383 Labyrinth(树的直径)
- poj 1383 Labyrinth 树的直径
- POJ 1383--Labyrinth【树的直径】
- poj--1383--Labyrinth(树的直径)
- POJ Problem 1383 Labyrinth【树的直径】
- POJ 1383--Labyrinth【树的直径】
- poj-1383-Labyrinth【树的直径】【经典】
- POJ 1383 Labyrinth(BFS 树的直径)
- Poj 1383--Labyrinth【树的直径】【bfs】
- poj 1383 Labyrinth(树的直径详解,简单明了!)
- 【POj】-1383-Labyrinth(树的直径,地图)
- POJ 1383 Labyrinth 【树的直径】【真正的图】
- POJ:1383 Labyrinth(可视化图求树的最大直径)
- POJ 1383 Labyrinth(迷宫问题,树的最大直径,经典问题)
- POJ 1382 Labyrinth(数的直径用DFS实现)
- HTML 个人简历源码
- POJ 1383 Labyrinth(迷宫问题,树的最大直径,经典问题)
- 从指定的数组中,随机抽取一个数
- for循环 逗号表达式
- 移动端Retina屏幕图片适配
- POJ 1383 Labyrinth (树的直径)
- 应用内打开App Store评分
- Serialize and Deserialize tree
- window环境下JDK的安装过程
- mysql 效率提升
- 【Android】RxJava的使用(二)Action
- jsp中forward和redirect的区别
- Retrofit实现异步访问数据
- Linux网络命令--mail邮件命令