• <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 閱讀(409) 評論(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);
            }
            }
            }

              回復  更多評論   

            <2007年11月>
            28293031123
            45678910
            11121314151617
            18192021222324
            2526272829301
            2345678

            導航

            統計

            常用鏈接

            留言簿(1)

            隨筆檔案

            搜索

            最新評論

            閱讀排行榜

            評論排行榜

            久久精品人人做人人爽电影| 久久久一本精品99久久精品66| 国产精品久久久久久福利漫画| 久久综合综合久久综合| 94久久国产乱子伦精品免费| 久久久久久A亚洲欧洲AV冫 | 国内精品久久久久久久久电影网| 亚洲人成无码www久久久| 久久精品aⅴ无码中文字字幕不卡| 亚洲AV日韩精品久久久久| 亚洲天堂久久精品| 久久久久国产精品嫩草影院| 国产精品一久久香蕉国产线看观看| 精品免费久久久久国产一区| 成人久久免费网站| 亚洲国产精品无码久久久久久曰| 97久久国产亚洲精品超碰热| 婷婷久久综合| 丁香五月综合久久激情| 欧美精品久久久久久久自慰| 久久精品综合一区二区三区| 2022年国产精品久久久久 | 婷婷久久精品国产| 久久综合九色综合欧美狠狠| 99久久国产宗和精品1上映| 久久久久这里只有精品 | 伊人久久大香线蕉av不卡| 26uuu久久五月天| 久久国产精品成人免费| 久久亚洲精品国产亚洲老地址| 国内精品久久久久久久久电影网| 久久久久AV综合网成人| 欧美丰满熟妇BBB久久久| 久久亚洲精品成人无码网站| 狠狠色丁香婷婷久久综合| 中文字幕亚洲综合久久菠萝蜜| 久久免费香蕉视频| 青青热久久国产久精品| 亚洲国产综合久久天堂 | 久久天天躁狠狠躁夜夜av浪潮| 99久久免费只有精品国产|