【POj】-1383-Labyrinth(树的直径,地图)
来源:互联网 发布:地理专业知乎 编辑:程序博客网 时间:2024/05/29 02:18
Labyrinth
Time Limit: 2000MS Memory Limit: 32768KTotal Submissions: 4419 Accepted: 1665
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
题解:好机智啊!!!用dfs当然会超时哦!用树的直径就ok,和之前做的题一样的。就是这次是图形。
AC代码:
#include<cstdio>#include<cstring>#include<vector>#include<queue>#include<algorithm>using namespace std;#define LL long long#define CLR(a,b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3fchar a[1010][1010];bool vis[1010][1010];int dx[4]={0,0,1,-1};int dy[4]={1,-1,0,0};int w,h,stx,sty;struct node{int x,y,sty;}pr,ne;bool check(node x){if(x.x<1||x.x>h||x.y>w||x.y<1||vis[x.x][x.y])return false;return true;}node bfs(int x,int y,int stp){queue<node> q;pr.x=x;pr.y=y;pr.sty=stp;vis[x][y]=true;q.push(pr);while(!q.empty()){pr=q.front();q.pop();for(int i=0;i<4;i++){ne=pr;ne.x+=dx[i];ne.y+=dy[i];if(!check(ne))continue;if(a[ne.x][ne.y]=='.'){vis[ne.x][ne.y]=true;ne.sty++;q.push(ne);}}}return pr;}int main(){int u;scanf("%d",&u);while(u--){int step=0,ans=0;CLR(vis,false);scanf("%d%d",&w,&h);for(int i=1;i<=h;i++)scanf("%s",a[i]+1);for(int i=1;i<=h;i++){for(int j=1;j<=w;j++){int stp=0;if(a[i][j]=='.'&&!vis[i][j]){node p=bfs(i,j,0);stx=p.x;sty=p.y;stp=p.sty;CLR(vis,0);// 这里一定要记得把vis全部变为 0 node q=bfs(stx,sty,0);//步数从0开始了 step=q.sty;ans=max(ans,step);}}}printf("Maximum rope length is %d.\n",ans);}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--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 1382 Labyrinth(数的直径用DFS实现)
- Linux系统下的3个文件时间
- Java基础类型与其二进制表示
- Objective-C:OC的字符串、类与对象
- 深入到ViewGroup内部,了解ViewGroup的工作
- js里调用函数时,函数名带括号和不带括号的区别
- 【POj】-1383-Labyrinth(树的直径,地图)
- 【HDU】5695 - Gym Class(拓扑)
- Android Lint 静态代码检查
- 2016"百度之星"-初赛(AstarRound2A)
- innerHTML nodeValue 的区别
- Catalan数——卡特兰数
- 计算机中如何表示数字-06浮点数
- [Codeforces 543C] Remembering Strings (状压DP)
- 桶排序