• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            comiz

            a problem of maze

            Problem Statement

            People enjoy mazes, but they also get them dirty. Arrows, graffiti, and chewing gum are just a few of the souvenirs people leave on the walls. You, the maze keeper, are assigned to whiten the maze walls. Each face of the wall requires one liter of paint, but you are only required to paint visible faces. You are given a map of the maze, and you must determine the amount of paint needed for the job.

            The maze is described by a vector <string> maze, where each character can be either '#' (a wall) or '.' (an empty space). All '.' characters on the perimeter of the map are considered entrances to the maze. Upon entering the maze, one can only move horizontally and vertically through empty spaces, and areas that are not reachable by these movements are not considered visible. Each '#' represents a square block with four wall faces (each side of the square is a face). A face is visible if it is not directly adjacent to another wall (and is in a reachable area of the maze). For example, two adjacent blocks can have at most six visible faces since two of their faces are directly adjacent to each other. All exterior faces on the perimeter are considered visible.

            For example, the following picture represents a trivial maze with just one (wide) entrance and only four empty reachable spaces:

             TroytownKeeper.png

            To whiten this maze you must paint the faces highlighted in yellow above: 16 for its perimeter, plus 8 interior faces. Note that there are faces that are not visible and thus need not be painted.

            Definition     

            Class: TroytownKeeper

            Method: limeLiters Parameters: vector <string>

            Returns: int

            Method signature: int limeLiters(vector <string> maze)

            (be sure your method is public)     

            Constraints

            - maze will contain between 1 and 50 elements, inclusive.

            - Each element of maze will contain between 1 and 50 characters, inclusive.

            - All elements of maze will have the same number of characters.

            - All characters in maze will be either '.' or '#' . Examples 0)  

             

               

            {"##..#",
            "#.#.#",
            "#.#.#",
            "#####"}
            Returns: 24

            posted on 2007-11-04 19:35 comiz 閱讀(411) 評論(1)  編輯 收藏 引用

            評論

            # re: a problem of maze 2007-11-04 19:35 comiz

            using System;
            using System.Collections;
            using System.ComponentModel;
            using System.Data;
            using System.Threading;

            namespace TroytownKeeper
            {

            public class TroytownKeeper
            {
            string [] maze;
            bool [,]used=new bool[100,100];
            int sum=0;
            public TroytownKeeper()
            {



            }

            public int LimeLiters(string [] maze)
            {
            this.maze=maze;
            for(int x=0;x<maze.GetLength(0);x++)
            {
            if(maze[x][0]=='.') dfs(x,0);
            if(maze[x][maze[0].Length-1]=='.') dfs(x,maze[0].Length-1);
            }
            for(int y=0;y<maze[0].Length-1;y++)
            {
            if(maze[0][y]=='.') dfs(0,y);
            if(maze[maze.GetLength(0)-1][y]=='.') dfs(maze.GetLength(0)-1,y);
            }

            for(int x=0;x<maze.GetLength(0);x++)
            for(int y=0;y<maze[0].Length;y++)
            if(maze[x][y]=='#')
            {
            //upside
            if(x==0)
            sum++;
            if(x<maze.Length-1&&used[x+1,y])
            sum++;
            //leftside
            if(y==0)
            sum++;
            if(y>0&&used[x,y-1])
            sum++;
            //underside
            if(x==maze.Length-1)
            sum++;
            if(x>0&&used[x-1,y])
            sum++;
            //rightside
            if(y==maze[0].Length-1)
            sum++;
            if(y<maze[0].Length-1&&used[x,y+1])
            sum++;
            }
            return sum;
            }

            static void Main(string[] args)
            {
            TroytownKeeper TK=new TroytownKeeper();
            string [] str={"##..#"
            ,"#.#.#"
            ,"#.#.#"
            ,"#####"};
            int count=TK.LimeLiters(str);
            Console.WriteLine(count.ToString());
            }


            void dfs(int x,int y)
            {
            used[x,y]=true;
            if(x<maze.GetLength(0)&&maze[x+1][y]=='.'&&!used[x+1,y]) dfs(x+1,y);
            if(y<maze[0].Length&&maze[x][y+1]=='.'&&!used[x,y+1]) dfs(x,y+1);
            if(x>0&&maze[x-1][y]=='.'&&!used[x-1,y]) dfs(x-1,y);
            if(y>0&&maze[x][y-1]=='.'&&!used[x,y-1]) dfs(x,y-1);
            }
            }
            }

              回復  更多評論   

            <2025年7月>
            293012345
            6789101112
            13141516171819
            20212223242526
            272829303112
            3456789

            導航

            統計

            常用鏈接

            留言簿(1)

            隨筆檔案

            搜索

            最新評論

            閱讀排行榜

            評論排行榜

            东方aⅴ免费观看久久av| 99久久国产宗和精品1上映| 亚洲精品国产成人99久久| 国产精品日韩深夜福利久久| 久久精品免费网站网| 亚洲国产精品无码久久98| 精品久久人人妻人人做精品| 亚洲精品蜜桃久久久久久| 婷婷综合久久中文字幕| 无码精品久久久久久人妻中字| 精品999久久久久久中文字幕| 麻豆久久久9性大片| 国产成人综合久久久久久| 久久久精品国产免大香伊| 国产精品久久久久久久午夜片| 久久人人爽人人爽人人片av高请| 国内精品伊人久久久久影院对白 | 精品国产91久久久久久久a | 香港aa三级久久三级| 人妻少妇久久中文字幕| 欧美日韩精品久久久久| 久久精品一区二区影院| 国产亚州精品女人久久久久久 | 亚洲国产精品无码久久一区二区 | 亚洲香蕉网久久综合影视| 国产AⅤ精品一区二区三区久久| 久久国产精品一国产精品金尊| 久久久精品人妻一区二区三区蜜桃| 久久乐国产精品亚洲综合| 99精品伊人久久久大香线蕉| 青青青国产成人久久111网站| 久久国产欧美日韩精品| 精品久久久久久亚洲精品| 久久久久亚洲精品天堂| 国产精品18久久久久久vr| 97久久超碰成人精品网站| a级成人毛片久久| 94久久国产乱子伦精品免费| 国产亚州精品女人久久久久久| 久久人人爽人人爽人人片AV麻豆| 久久国产影院|