zoukankan      html  css  js  c++  java
  • Children of the Candy Corn 分类: POJ 2015-07-14 08:19 7人阅读 评论(0) 收藏

    Children of the Candy Corn
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 10933   Accepted: 4708

    Description

    The cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through the maze facing zombies, chainsaw-wielding psychopaths, hippies, and other terrors on their quest to find the exit.

    One popular maze-walking strategy guarantees that the visitor will eventually find the exit. Simply choose either the right or left wall, and follow it. Of course, there's no guarantee which strategy (left or right) will be better, and the path taken is seldom the most efficient. (It also doesn't work on mazes with exits that are not on the edge; those types of mazes are not represented in this problem.)

    As the proprieter of a cornfield that is about to be converted into a maze, you'd like to have a computer program that can determine the left and right-hand paths along with the shortest path so that you can figure out which layout has the best chance of confounding visitors.

    Input

    Input to this problem will begin with a line containing a single integer n indicating the number of mazes. Each maze will consist of one line with a width, w, and height, h (3 <= w, h <= 40), followed by h lines of w characters each that represent the maze layout. Walls are represented by hash marks ('#'), empty space by periods ('.'), the start by an 'S' and the exit by an 'E'.

    Exactly one 'S' and one 'E' will be present in the maze, and they will always be located along one of the maze edges and never in a corner. The maze will be fully enclosed by walls ('#'), with the only openings being the 'S' and 'E'. The 'S' and 'E' will also be separated by at least one wall ('#').

    You may assume that the maze exit is always reachable from the start point.

    Output

    For each maze in the input, output on a single line the number of (not necessarily unique) squares that a person would visit (including the 'S' and 'E') for (in order) the left, right, and shortest paths, separated by a single space each. Movement from one square to another is only allowed in the horizontal or vertical direction; movement along the diagonals is not allowed.

    Sample Input

    2
    8 8
    ########
    #......#
    #.####.#
    #.####.#
    #.####.#
    #.####.#
    #...#..#
    #S#E####
    9 5
    #########
    #.#.#.#.#
    S.......E
    #.#.#.#.#
    #########

    Sample Output

    37 5 5
    17 17 9
    注意好靠左走和靠右走的方向就行
    
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <cmath>
    #include <string>
    #include <map>
    #include <set>
    #include <queue>
    #include <stack>
    #include <algorithm>
    #include <cstdlib>
    #define INF 0x3f3f3f3f
    
    using namespace std;
    
    char Map[100][110];
    int Left,Right,Short;
    bool vis[110][110];
    int Dir[][2]={{0,1},{1,0},{0,-1},{-1,0}};
    int n,m;
    struct node
    {
        int x;
        int y;
        int step;
    };
    void Left_Look(int step,int dir,int X,int Y)
    {
        if(Map[X][Y]=='E')
        {
            Left=step;
            return ;
        }
        dir--;
        if(dir<0)
        {
            dir=3;
        }
        int d,fx,fy;
        for(int i=0;i<4;i++)
        {
            d=dir+i;
            if(d>=4)
            {
                d-=4;
            }
            fx=Dir[d][0]+X;
            fy=Dir[d][1]+Y;
            if(fx>=0&&fx<n&&fy>=0&&fy<m&&Map[fx][fy]!='#')
            {
                Left_Look(step+1,d,fx,fy);
                break;
            }
        }
    }
    void Right_Look(int step,int dir,int X,int Y)
    {
        if(Map[X][Y]=='E')
        {
            Right=step;
            return ;
        }
        dir++;
        dir%=4;
        int d,fx,fy;
        for(int i=0;i<4;i++)
        {
            d=dir-i;
            if(d<0)
            {
                d+=4;
            }
            fx=Dir[d][0]+X;
            fy=Dir[d][1]+Y;
            if(fx>=0&&fx<n&&fy>=0&&fy<m&&Map[fx][fy]!='#')
            {
                Right_Look(step+1,d,fx,fy);
                break;
            }
        }
    }
    void BFS(int X,int Y)
    {
        node a,b;
        a.x=X;
        a.y=Y;
        a.step=1;
        memset(vis,false,sizeof(vis));
        vis[X][Y]=true;
        queue<node >Q;
        Q.push(a);
        while(!Q.empty())
        {
            a=Q.front();
            Q.pop();
            if(Map[a.x][a.y]=='E')
            {
                Short=a.step;
                return ;
            }
            for(int i=0;i<4;i++)
            {
                b.x=a.x+Dir[i][0];
                b.y=a.y+Dir[i][1];
                b.step=a.step+1;
                if(b.x>=0&&b.x<n&&b.y>=0&&b.y<m&&!vis[b.x][b.y]&&Map[b.x][b.y]!='#')
                {
                    vis[b.x][b.y]=true;
                    Q.push(b);
                }
            }
        }
    }
    int main()
    {
        int T;
    
        int x;
        int y;
        scanf("%d",&T);
        while(T--)
        {
            scanf("%d %d",&m,&n);
            for(int i=0; i<n; i++)
            {
                scanf("%s",Map[i]);
                for(int j=0;j<m;j++)
                {
                    if(Map[i][j]=='S')
                    {
                        x=i;
                        y=j;
                    }
                }
            }
            if(x==0)
            {
    
    
                Left_Look(1,2,x,y);
                Right_Look(1,2,x,y);
            }
            else if(x==n-1)
            {
                Left_Look(1,0,x,y);
                Right_Look(1,0,x,y);
            }
            else if(y==0)
            {
                Left_Look(1,1,x,y);
                Right_Look(1,1,x,y);
            }
            else if(y==m-1)
            {
                Left_Look(1,3,x,y);
                Right_Look(1,3,x,y);
            }
            BFS(x,y);
            cout<<Left<<" "<<Right<<" "<<Short<<endl;
        }
        return 0;
    }
    


    版权声明:本文为博主原创文章,未经博主允许不得转载。

  • 相关阅读:
    关于ExtJSExtender 拓荒者
    jquery easyui datagrid 分页数据请求 拓荒者
    ExtJS布局:制作后台管理布局 拓荒者
    WebAPI用法 拓荒者
    WordPress实践:上传文件时提示“缺少临时文件夹” 拓荒者
    【转】Javascript MD5编码 拓荒者
    看懂ExtJS的API 拓荒者
    IIS下实现wordpress URL静态化 拓荒者
    再谈angularjs DI(Dependency Injection)
    Javascript覆盖率(jstd)报表解析Maven插件
  • 原文地址:https://www.cnblogs.com/juechen/p/4721964.html
Copyright © 2011-2022 走看看