zoukankan      html  css  js  c++  java
  • J

    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.

    Input

    3 4 2
    #..#
    ..#.
    #...
    

    Output

    #.X#
    X.#.
    #...
    

    Input

    5 4 5
    #...
    #.#.
    .#..
    ...#
    .#.#
    

    Output

    #XXX
    #X#.
    X#..
    ...#
    .#.#
    #include <cstdio>
    #include <iostream>
    #include <cstring>
    #include <algorithm>
    using namespace std;
    struct node{
        int x,y,father,son;
    }tree[250010];
    int n,m,k,sx,sy,tot;
    char temp;
    int map[550][550];
    void dfs(int x,int y,int father){
        if(k<=0)return;
        int id=tot++;
        tree[id].x=x;
        tree[id].y=y;
        tree[id].father=father;
        tree[id].son=0;
        map[x][y]=-1;
        if(map[x+1][y]==1&&k>0)
            tree[id].son++,dfs(x+1,y,id);
        if(map[x-1][y]==1&&k>0)
            tree[id].son++,dfs(x-1,y,id);
        if(map[x][y+1]==1&&k>0)
            tree[id].son++,dfs(x,y+1,id);
        if(map[x][y-1]==1&&k>0)
            tree[id].son++,dfs(x,y-1,id);
        if(tree[id].son==0&&k>0)
            map[x][y]=2,tree[father].son--,k--;
    }
    int main(){
        cin>>n>>m>>k;
        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++){
                cin>>temp;
                if(temp=='#')map[i][j]=0;
                if(temp=='.')map[i][j]=1;
            }
        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++)
                if(map[i][j]==1){sx=i;sy=j;break;}
        dfs(sx,sy,0);
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++)
                if(map[i][j]==0)cout<<'#';
                else if(map[i][j]==-1)cout<<'.';
                else if(map[i][j]==2)cout<<'X';
                else if(map[i][j]==1)cout<<'.';
            cout<<endl;
        }
        return 0;
    }
  • 相关阅读:
    【机器学习】浅谈协方差
    python {}.format
    【机器学习】准确率、精确率、召回率
    【声纹识别】 EER
    【机器学习】 最形象的入门
    逻辑卷-LVM
    RAID及软RAID的实现
    输入数字or 字符串,统计重复次数---字典统计练习
    Python-数据结构之dict(字典*****)
    POJ 3204 网络流的必须边
  • 原文地址:https://www.cnblogs.com/Staceyacm/p/10782134.html
Copyright © 2011-2022 走看看