Codeforces Round #297 (Div. 2) 525D Arthur and Walls(dfs)

最新推荐文章于 2018-04-22 19:05:29 发布

原创最新推荐文章于 2018-04-22 19:05:29 发布 · 777 阅读

0 ·

CC 4.0 BY-SA版权

Codeforces 同时被 2 个专栏收录

91 篇文章

订阅专栏

深度优先搜索(dfs)

29 篇文章

订阅专栏

本文深入探讨了AI音视频处理领域中的视频分割与语义识别技术，介绍了视频分割的基本概念、算法及其应用，并详细阐述了语义识别在不同场景下的实现方法，包括自动驾驶、AR增强现实等领域的应用实例。

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
        
.....
.....
.....
.....

         
 
        

题目链接:点击打开链接

给出n * m的地图, '*'代表墙, '.'代表房间, 墙可以变为房间, 现要求房间为长方形, 问最少需要变化后的房间.

dfs的条件是四个点组成的形状只有一个'*', 于是将这个墙变为房间, 继续dfs, 可以使得变化最少.

AC代码:

#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
#include "queue"
#include "stack"
#include "cmath"
#include "utility"
#include "map"
#include "set"
#include "vector"
#include "list"
#include "string"
#include "cstdlib"
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int MAXN = 2005;
int n, m;
char maze[MAXN][MAXN];
void Dfs(int x, int y)
{
	if(x >= n - 1 || y >= m - 1 || x < 0 || y < 0) return;
	int xx, yy, s = 0;
	for(int i = 0; i < 2; ++i)
		for(int j = 0; j < 2; ++j)
			if(maze[x + i][y + j] == '*') {
				s++;
				xx = x + i;
				yy = y + j;
			}
	if(s == 1) {
		maze[xx][yy] = '.';
		for(int i = -1; i < 1; ++i)
			for(int j = -1; j < 1; ++j)
				Dfs(xx + i, yy + j);
	}

}
int main(int argc, char const *argv[])
{
	scanf("%d %d", &n, &m);
	for(int i = 0; i < n; ++i)
		scanf("%s", maze[i]);
	for(int i = 0; i < n - 1; ++i)
		for(int j = 0; j < m - 1; ++j)
			Dfs(i, j);
	for(int i = 0; i < n; ++i)
		printf("%s\n", maze[i]);
	return 0;
}