zoukankan      html  css  js  c++  java
  • POJ 1383 Labyrinth

    Labyrinth

    Time Limit: 2000ms
    Memory Limit: 32768KB
    This problem will be judged on PKU. Original ID: 1383
    64-bit integer IO format: %lld      Java class name: Main
     
    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
     

    Source

    解题:求树的直径

     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <cmath>
     5 #include <algorithm>
     6 #include <climits>
     7 #include <vector>
     8 #include <queue>
     9 #include <cstdlib>
    10 #include <string>
    11 #include <set>
    12 #include <stack>
    13 #define LL long long
    14 #define pii pair<int,int>
    15 #define INF 0x3f3f3f3f
    16 using namespace std;
    17 const int maxn = 1010;
    18 char mp[maxn][maxn];
    19 int col,row,vis[maxn][maxn],tx,ty;
    20 const int dir[4][2] = {-1,0,1,0,0,1,0,-1};
    21 queue< pii > q;
    22 int bfs(int sx,int sy){
    23     while(!q.empty()) q.pop();
    24     q.push(make_pair(sx,sy));
    25     memset(vis,-1,sizeof(vis));
    26     vis[sx][sy] = 0;
    27     int mxlen = 0;
    28     while(!q.empty()){
    29         int x = q.front().first;
    30         int y = q.front().second;
    31         q.pop();
    32         if(vis[x][y] > mxlen) mxlen = vis[tx = x][ty = y];
    33         for(int i = 0; i < 4; ++i){
    34             int nx = x + dir[i][0];
    35             int ny = y + dir[i][1];
    36             if(mp[nx][ny] == '#' || vis[nx][ny] > -1) continue;
    37             vis[nx][ny] = vis[x][y] + 1;
    38             q.push(make_pair(nx,ny));
    39         }
    40     }
    41     return mxlen;
    42 }
    43 int main() {
    44     int T;
    45     scanf("%d",&T);
    46     while(T--){
    47         scanf("%d %d",&col,&row);
    48         for(int i = 0; i < row; ++i)
    49             scanf("%s",mp[i]);
    50         bool flag = true;
    51         for(int i = 1; flag&&i < row; ++i){
    52             for(int j = 1; flag&&j < col; ++j){
    53                 if(mp[i][j] == '.'){
    54                     flag = false;
    55                     bfs(i,j);
    56                     printf("Maximum rope length is %d.
    ",bfs(tx,ty));
    57                 }
    58             }
    59         }
    60     }
    61     return 0;
    62 }
    View Code
  • 相关阅读:
    linux下如何查看cpu信息
    Linux更换HBA卡后重新扫盘指令
    oracle 11gR2 RAC存储迁移
    Data Migration from Various Storage Types Using EMC VPLEX and EMC RecoverPoint Technologies
    【11grac】Oracle RAC 更换存储实验
    Oracle RAC 11GR2更换主机不换存储--ASM磁盘组异机挂载 推荐 原创
    ELK(Elasticsearch + Logstash + Kibana) 日志分析平台
    Ogg For Bigdata 同步Oracle数据到KAFKA(包括初始化历史数据)
    stm32cubemx+clion环境搭建
    stdarg宏与实现stm32printf串口打印
  • 原文地址:https://www.cnblogs.com/crackpotisback/p/4103125.html
Copyright © 2011-2022 走看看