Codeforces Round #297 (Div. 2) D. Arthur and Walls [ 思维 + bfs ]

传送门

D. Arthur and Walls

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

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

.....
.....
.....
.....



先转一发官方题解：
http://codeforces.ru/blog/entry/17119?locale=en

525D — Arthur and Walls

To solve this problem we need to observe next fact. If in some square whith size 2 × 2 in given matrix there is exactly one asterisk, we must change it on dot. That is if in matrix from dots and asterisks is not square 2 × 2 in which exactly one asterisk and three dots, then all maximum size of the area from dots connected by sides represent rectangles.

Now solve the problem with help of bfs and this fact. Iterate on all asterisks in given matrix and if only this asterisk contains in some 2 × 2 square, change this asterisk on dot and put this position in queue. Than we need to write standart bfs, in which we will change asterisks on dots in all come out 2 × 2 squares with exactly one asterisk.

Asymptotic behavior of this solution — O(n * m), where n and m sizes of given matrix.

 

 

题意：

将 由 '.' 构成的联通区域变成矩形（通过将 '*' 改成 '.' ）

题解：

很不错的一个想法，2*2 的矩形中，如果有一个 '*' 与三个 '.' ，那么这个 '*' 就一定要变成 ‘.' ，然后就bfs 找类似这种 2*2的矩形。

 

 

10495549

2015-03-28 05:12:33

njczy2010

D - Arthur and Walls

GNU C++

Accepted

732 ms

27100 KB

 

#include <cstdio>
#include <cstring>
#include <stack>
#include <vector>
#include <map>
#include <algorithm>
#include <queue>

#define ll long long
int const N = 2005;
int const M = 205;
int const inf = 1000000000;
ll const mod = 1000000007;

using namespace std;

int n,m;
char s[N][N];
int dirx[]={-1,-1,0,1,1,1,0,-1};
int diry[]={0,1,1,1,0,-1,-1,-1};
int used[N][N];

typedef struct
{
    int x;
    int y;
}PP;

void ini()
{
    int i;
    for(i=1;i<=n;i++){
        scanf("%s",s[i]+1);
    }
    memset(used,0,sizeof(used));
}

int isok(int x,int y)
{
    if(x>=1 && x<=n && y>=1 && y<=m && s[x][y]=='.'){
        return 1;
    }
    else{
        return 0;
    }
}

int check(int x,int y)
{
    if(x<1 || x>n || y<1 || y>m || s[x][y]=='.') return 0;
    int i;
    int d[10];
    for(i=0;i<8;i++){
        d[i]=isok(x+dirx[i],y+diry[i]);
    }
    d[8]=d[0];
   // printf(" x=%d y=%d\n",x,y);
   // for(i=0;i<=8;i++){
   //     printf("  i=%d d=%d\n",i,d[i]);
   // }
    for(i=0;i<8;i+=2){
        //printf("  i=%d d=%d\n",i,d[i]);
        if(d[i] && d[i+1] && d[i+2])
            return 1;
    }
    return 0;
}

void solve()
{
    queue< PP > que;
    PP te,nt;
    int i,j;
    for(i=1;i<=n;i++){
        for(j=1;j<=m;j++){
            if(check(i,j)==1){
                te.x=i;te.y=j;
                //printf(" x=%d y=%d\n",te.x,te.y);
                que.push(te);
                used[i][j]=1;
            }
        }
    }

    while(que.size()>=1){
        te=que.front();que.pop();
        //printf(" x=%d y=%d\n",te.x,te.y);
        s[te.x][te.y]='.';
        for(i=0;i<8;i++){
            nt.x=te.x+dirx[i];
            nt.y=te.y+diry[i];
            if(used[nt.x][nt.y]==0 && check(nt.x,nt.y)==1){
                used[nt.x][nt.y]=1;
                que.push(nt);
            }
        }
    }
}

void out()
{
    int i;
    for(i=1;i<=n;i++){
        printf("%s\n",s[i]+1);
    }
}

int main()
{
    //freopen("data.in","r",stdin);
   // freopen("data.out","w",stdout);
    //scanf("%d",&T);
    //for(int cnt=1;cnt<=T;cnt++)
    //while(T--)
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        ini();
        solve();
        out();
    }
}