CodeForces 525D Arthur and Walls（DIV2 D）（DFS+YY）

最新推荐文章于 2018-01-30 14:25:29 发布

kalilili

最新推荐文章于 2018-01-30 14:25:29 发布

阅读量781

点赞数

分类专栏： DFS

本文链接：https://blog.csdn.net/kalilili/article/details/44724351

版权

DFS 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

Finally it is a day when Arthur has enough money for buying an apartment. He found a great option close to the center of the city with a nice price.

Plan of the apartment found by Arthur looks like a rectangle n × m consisting of squares of size 1 × 1. Each of those squares contains either a wall (such square is denoted by a symbol "*" on the plan) or a free space (such square is denoted on the plan by a symbol ".").

Room in an apartment is a maximal connected area consisting of free squares. Squares are considered adjacent if they share a common side.

The old Arthur dream is to live in an apartment where all rooms are rectangles. He asks you to calculate minimum number of walls you need to remove in order to achieve this goal. After removing a wall from a square it becomes a free square. While removing the walls it is possible that some rooms unite into a single one.

Input

The first line of the input contains two integers n, m (1 ≤ n, m ≤ 2000) denoting the size of the Arthur apartments.

Following n lines each contain m symbols — the plan of the apartment.

If the cell is denoted by a symbol "*" then it contains a wall.

If the cell is denoted by a symbol "." then it this cell is free from walls and also this cell is contained in some of the rooms.

Output

Output n rows each consisting of m symbols that show how the Arthur apartment plan should look like after deleting the minimum number of walls in order to make each room (maximum connected area free from walls) be a rectangle.

If there are several possible answers, output any of them.

         Sample test(s) 
       

           input 
         
5 5
.*.*.
*****
.*.*.
*****
.*.*.

           output 
         
.*.*.
*****
.*.*.
*****
.*.*.

           input 
         
6 7
***.*.*
..*.*.*
*.*.*.*
*.*.*.*
..*...*
*******

           output 
         
***...*
..*...*
..*...*
..*...*
..*...*
*******

           input 
         
4 5
.....
.....
..***
..*..

           output 
         
.....
.....
.....
.....
 
          
 
         

大致题意：'.'表示房子，要把'*'改成'.'号使所有的房子均呈矩形

思路：初看的确不容易下手，YY出dfs的方法：需要把'*'变成'.'的地方必然从一个角形状的房子开始，然后用渲染开来

所以用枚举图中的点先找到一个角，还是cf的测评机速度快啊orz

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N= 2020;
char mapp[N][N];
int r,c;
int dx[5]={0,1,0,-1,0}; //前一个和后一个dx，dy坐标呈90度
int dy[5]={1,0,-1,0,1};
int f(int a,int b)
{
    return a? a:b;
}
void dfs(int x,int y)
{
    if(mapp[x][y]!='*') return;
    for(int i=0;i<4;i++)
    {
        int x1=x+dx[i];
        int y1=y+dy[i];
        int x2=x+dx[i+1];
        int y2=y+dy[i+1];
        int x3=x+f(dx[i],dx[i+1]);
        int y3=y+f(dy[i],dy[i+1]);
        if(mapp[x1][y1]=='.'&&mapp[x2][y2]=='.'&&mapp[x3][y3]=='.')
        {
            mapp[x][y]='.';
            for(int nx=x-1;nx<=x+1;nx++)  //开始把'.'感染开来
                for(int ny=y-1;ny<=y+1;ny++)
                    dfs(nx,ny);
            return ;
        }
    }
}
int main()
{
    scanf("%d%d",&r,&c);
    for(int i=1;i<=r;i++)
        scanf("%s",mapp[i]+1);
    for(int i=1;i<=r;i++)
        for(int j=1;j<=c;j++)
            dfs(i,j);
    for(int i=1;i<=r;i++)
        printf("%s\n",mapp[i]+1);
    return 0;
}