【POJ】1383 - Labyrinth(树的直径)
来源:互联网 发布:全民枪战刷龙软件 编辑:程序博客网 时间:2024/05/29 03:02
点击打开题目
Labyrinth
Time Limit: 2000MS Memory Limit: 32768KTotal 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.
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
从任意一点出发dfs一下,再从最远的点dfs一下就行了。
代码如下:
#include <cstdio>#include <cstring>#include <queue>#include <algorithm>using namespace std;#define CLR(a,b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define MAX 1000struct node{int x,y;int step;}pr,ne;int w,h;char mapp[MAX+5][MAX+5];bool used[MAX+5][MAX+5];int mx[] = {0,0,1,-1};int my[] = {1,-1,0,0};bool check(node x){if (x.x < 1 || x.x > h || x.y < 1 || x.y > w || mapp[x.x][x.y] == '#' || used[x.x][x.y])return false;return true;}node dfs(node x){x.step = 0;//不初始化第二次dfs会出错 queue<node> q;q.push(x);CLR(used,false);used[x.x][x.y] = true;int maxx = 0;node ans = x;while (!q.empty()){pr = q.front();q.pop();for (int i = 0 ; i < 4 ; i++){ne = pr;ne.x += mx[i];ne.y += my[i];ne.step++;if (!check(ne))continue;q.push(ne);used[ne.x][ne.y] = true;if (ne.step > maxx){ans = ne;maxx = ne.step;}}}return ans;}int main(){int u;int stx,sty;scanf ("%d",&u);while (u--){scanf ("%d %d",&w,&h);for (int i = 1 ; i <= h ; i++){scanf ("%s",mapp[i]+1);for (int j = 1 ; j <= w ; j++)if (mapp[i][j] == '.'){stx = i;sty = j;break;}}pr.x = stx;pr.y = sty;pr.step = 0;node res;res = dfs(pr);res = dfs(res);printf ("Maximum rope length is %d.\n",res.step);}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实现)
- Windows路由表配置:双网卡同时上公司内外网
- JS函数写错时是否执行问题
- ffplay.c数据结构分析
- easyui-combobox多选下拉框
- mysql sql语句
- 【POJ】1383 - Labyrinth(树的直径)
- 互联网时代
- <手动安装Openstack Mikita>之(三) Glance安装
- sturts的学习和使用
- Android实现首字母导航条(仿微信)
- solr管理界面详解
- iOS 面试题(2)
- int与integer的区别
- ajax的两个关键字