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

    poj 1383 Labyrinth 【 BFS实现 树的直径裸题】

    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.
    

    题解 : 两次bfs,第一次求到树的一个端点,然后再求到另一个端点。

    #include<cstdio>
    #include<cstring>
    #include<queue>
    #include<algorithm>
    #include<stack>
    using namespace std;
    int n,m;
    char mapp[1010][1010];
    int vis[1010][1010];
    int sx,sy;
    struct node{
        int x;
        int y;
        int setp;
    }pr,ne;
    int ans;
    bool check(int x,int y)
    {
        if(x<0||y<0||x>=n||y>=m||vis[x][y]||mapp[x][y]=='#')
            return false;
        return true;    
    
    }
    
    void bfs(int xx,int yy)
    {
        ans=0;
        memset(vis,0,sizeof(vis));
        queue<node>q;
        int fx[4]={0,0,1,-1};
        int fy[4]={1,-1,0,0};
        pr.x =xx;
        pr.y =yy;
        pr.setp =0;
        vis[xx][yy]=1;
        q.push(pr);
        while(!q.empty() )
        {
            pr=q.front() ;
            q.pop() ;
            for(int i=0;i<4;i++)
            {
                ne.x =pr.x +fx[i];
                ne.y =pr.y +fy[i];
                ne.setp =pr.setp +1;
                if(check(ne.x ,ne.y ))
                {
    
                    vis[ne.x ][ne.y ]=1; 
                    if(ne.setp >ans)
                    {
                        ans=ne.setp ;
                        sx=ne.x ;
                        sy=ne.y ;
                    }
                    q.push(ne);
                }
            }
    
         } 
    }
    
    int main()
    {
        int t;
        scanf("%d",&t);
        while(t--)
        {
            scanf("%d%d",&m,&n);
             bool flag = false;  
            for(int i=0;i<n;i++)
            {
                scanf("%s",mapp[i]);
                if(flag) continue;
                for(int j=0;j<m;j++)
                {
                    if(mapp[i][j]=='.')
                    {
                        sx=i;
                        sy=j;
                        flag=true;
                    }
                }
            }   
            bfs(sx,sy);
            bfs(sx,sy);
            printf("Maximum rope length is %d.
    ",ans ); 
        }
        return 0;
    }
    
    
  • 相关阅读:
    Kinect关于PlayerIndex和SkeletonId之间的关系。
    记一次“应用程序之间的通信”过程(1/2)
    C# p-Inovke C++动态链接库
    我写了本破书-swift语言实战晋级
    swift语言实战晋级-第9章 游戏实战-跑酷熊猫-9-10 移除平台与视差滚动
    swift语言实战晋级-第9章 游戏实战-跑酷熊猫-7-8 移动平台的算法
    Swift语言实战晋级-第9章 游戏实战-跑酷熊猫-5-6 踩踏平台是怎么炼成的
    Swift语言实战晋级-第9章 游戏实战-跑酷熊猫-4 熊猫的跳和打滚
    Swift语言实战晋级-第9章 游戏实战-跑酷熊猫-3 显示一个动态的熊猫
    Swift语言实战晋级-第9章 游戏实战-跑酷熊猫-2 创建熊猫类
  • 原文地址:https://www.cnblogs.com/-xiangyang/p/9220265.html
Copyright © 2011-2022 走看看