Labyrinth
Time Limit: 2000MS Memory Limit: 32768K
Total Submissions: 4184 Accepted: 1564
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.
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
2
3 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
题意:
一条" . "和“ # ”字符构成的图,“.”代表一个钩子,问把图中的钩子连接起来需要的线最长要多长。
思路:
两次bfs,第一次可以从任一点开始找到最长通路的端点,因为不论从那一点开始,距离它最远的点,一定是最长通路端点。
第二次从端点开始搜索,记录最长距离
AC代码:
#include<iostream>
#include<cstring>
#include<queue>
#include<cstdio>
using namespace std;
int m,n,startx,starty,ans;
int flag[1005][1005];
char map[1005][1005];
struct node
{
int x,y,step;
};
void bfs()
{
memset(flag,0,sizeof(flag));
flag[startx][starty]=1;
int dx[]= {0,0,-1,1};
int dy[]= {-1,1,0,0};
queue<node> que;
node p;
p.x=startx;
p.y=starty;
p.step=0;
que.push(p);
ans=0;//第一次的时候求最长路径
while(!que.empty())
{
node t=que.front();
que.pop();
for(int k=0;k<=3;k++)
{
node q;
q.x=t.x+dx[k];
q.y=t.y+dy[k];
q.step=t.step+1;
if(map[q.x][q.y]=='.'&&q.x>=0&&q.x<n&&q.y>=0&&q.y<m&&flag[q.x][q.y]==0)
{
que.push(q);
flag[q.x][q.y]=1;
if(q.step>ans)
{
ans=q.step;
startx=q.x;
starty=q.y;
}
}
}
}
}
int main()
{
int K;
cin>>K;
while(K--)
{
cin>>m>>n;
bool flag = false;
for(int i=0;i<n;i++)
{
scanf("%s",map[i]);
if(flag) continue;
for(int j=0;j<m;j++)
{
if(map[i][j]=='.')
{
startx=i;
starty=j;
flag=true;
}
}
}
bfs();
bfs();
printf("Maximum rope length is %d.\n",ans);;
}
}