• <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 閱讀(420) 評(píng)論(1)  編輯 收藏 引用

            評(píng)論

            # 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);
            }
            }
            }

              回復(fù)  更多評(píng)論   


            只有注冊(cè)用戶登錄后才能發(fā)表評(píng)論。
            網(wǎng)站導(dǎo)航: 博客園   IT新聞   BlogJava   博問   Chat2DB   管理


            <2025年9月>
            31123456
            78910111213
            14151617181920
            21222324252627
            2829301234
            567891011

            導(dǎo)航

            統(tǒng)計(jì)

            常用鏈接

            留言簿(1)

            隨筆檔案

            搜索

            最新評(píng)論

            閱讀排行榜

            評(píng)論排行榜

            久久久久久午夜精品| 久久精品一区二区三区AV| 精品久久久久久久久中文字幕| 久久夜色精品国产网站| 久久成人国产精品二三区| 久久久人妻精品无码一区| 久久妇女高潮几次MBA| 狠狠色丁香久久综合五月| 2021久久精品免费观看| 久久久久久狠狠丁香| 中文字幕久久波多野结衣av| 人人狠狠综合久久亚洲88| 久久精品国产男包| 国产精品无码久久久久| 久久综合给合久久国产免费| 久久国产香蕉视频| 亚洲天堂久久精品| 国产精品国色综合久久| 少妇熟女久久综合网色欲| 久久国产香蕉视频| 久久免费美女视频| 精品久久久久久亚洲精品| 国产亚洲美女精品久久久2020| 精品综合久久久久久88小说 | 国内精品久久久久久久久| 无码人妻久久一区二区三区免费丨| 国产福利电影一区二区三区久久老子无码午夜伦不 | 2021久久精品免费观看| 麻豆久久| 伊人久久大香线蕉综合网站| 国产精品免费久久| 99国内精品久久久久久久| 久久亚洲国产欧洲精品一| 国产三级久久久精品麻豆三级| 99精品国产99久久久久久97 | 久久ZYZ资源站无码中文动漫| 伊人久久大香线蕉综合网站| 粉嫩小泬无遮挡久久久久久 | 一本色综合久久| 伊人久久大香线蕉AV一区二区| 久久这里有精品|