zoukankan      html  css  js  c++  java
  • Maze dfs倒行

    Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.

    Pavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.

    Input

    The first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.

    Each of the next n lines contains m characters. They describe the original maze. If a character on a line equals ".", then the corresponding cell is empty and if the character equals "#", then the cell is a wall.

    Output

    Print n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as "X", the other cells must be left without changes (that is, "." and "#").

    It is guaranteed that a solution exists. If there are multiple solutions you can output any of them.

    Example
    Input
    3 4 2
    #..#
    ..#.
    #...
    Output
    #.X#
    X.#.
    #...
    Input
    5 4 5
    #...
    #.#.
    .#..
    ...#
    .#.#
    Output
    #XXX
    #X#.
    X#..
    ...#
    .#.#


    一开始用的广搜,不对,广搜没啥合理性,实在是找不出道理,但是深搜可以,深搜可以把所有点连成一棵树,按顺序删除一些结点不会影响连通性,所以用递归
    dfs直到四个方位都遍历过了,再把这个结点删除。


    代码:


    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <map>
    #include <queue>
    #include <cmath>
    using namespace std;
    int n,m,k,rc=0,sx,sy;
    int dir[4][2]={0,1,1,0,0,-1,-1,0};
    char mp[501][501];
    int vis[501][501];
    void dfs(int x,int y)
    {
        if(x<0||y<0||x>=n||y>=m)return;
        if(mp[x][y]=='#'||vis[x][y])return ;
        vis[x][y]=1;
        for(int i=0;i<4;i++)
        {
            int tx=x+dir[i][0];
            int ty=y+dir[i][1];
            dfs(tx,ty);
        }
        if(k)mp[x][y]='X',k--;
    }
    int main()
    {
        ios::sync_with_stdio(false);
        cin.tie(0);
        cin>>n>>m>>k;
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                cin>>mp[i][j];
                if(mp[i][j]=='.')sx=i,sy=j;
                else vis[i][j]=1;
            }
        }
    
        dfs(sx,sy);
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            putchar(mp[i][j]);
    
            putchar('
    ');
        }
    }
  • 相关阅读:
    内网很安全?错错错!附攻击演示
    Fiddler无所不能——之测试开发攻城狮必备利器
    【橙子独创】【假设前置数据异常法】案列解析
    偶发异常BUG,如何高效精准分析排查定位?
    史上最全提现模块案例分解
    移动端推送测试涉及点
    模拟导入系统通讯录5000+手机号 校验批量数据处理是否正常?
    发散逆向思维之查询类列表测试范围的思考
    PICT工具一键生成正交试验用例
    据说黑白红客大多是出身测试行业,那么前戏如何做好呢?戳下
  • 原文地址:https://www.cnblogs.com/8023spz/p/7236302.html
Copyright © 2011-2022 走看看