D. Lakes in Berland
time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

The map of Berland is a rectangle of the size n × m, which consists of cells of size 1 × 1. Each cell is either land or water. The map is surrounded by the ocean.

Lakes are the maximal regions of water cells, connected by sides, which are not connected with the ocean. Formally, lake is a set of water cells, such that it's possible to get from any cell of the set to any other without leaving the set and moving only to cells adjacent by the side, none of them is located on the border of the rectangle, and it's impossible to add one more water cell to the set such that it will be connected with any other cell.

You task is to fill up with the earth the minimum number of water cells so that there will be exactly k lakes in Berland. Note that the initial number of lakes on the map is not less than k.

Input

The first line of the input contains three integers nm and k (1 ≤ n, m ≤ 50, 0 ≤ k ≤ 50) — the sizes of the map and the number of lakes which should be left on the map.

The next n lines contain m characters each — the description of the map. Each of the characters is either '.' (it means that the corresponding cell is water) or '*' (it means that the corresponding cell is land).

It is guaranteed that the map contain at least k lakes.

Output

In the first line print the minimum number of cells which should be transformed from water to land.

In the next n lines print m symbols — the map after the changes. The format must strictly follow the format of the map in the input data (there is no need to print the size of the map). If there are several answers, print any of them.

It is guaranteed that the answer exists on the given data.

Examples
input
```5 4 1
****
*..*
****
**.*
..**
```
output
```1
****
*..*
****
****
..**
```
input
```3 3 0
***
*.*
***
```
output
```1
***
***
***
```
Note

In the first example there are only two lakes — the first consists of the cells (2, 2) and (2, 3), the second consists of the cell (4, 3). It is profitable to cover the second lake because it is smaller. Pay attention that the area of water in the lower left corner is not a lake because this area share a border with the ocean.

```#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define CLR(arr,val) memset(arr,val,sizeof(arr))
#define LC(x) (x<<1)
#define RC(x) ((x<<1)+1)
#define MID(x,y) ((x+y)>>1)
typedef pair<int,int> pii;
typedef long long LL;
const double PI=acos(-1.0);
const int N=55;
struct info
{
int need;
int x,y;
bool operator<(const info &t)const
{
return need>t.need;
}
};
priority_queue<info>Q;

char pos[N][N];
int vis[N][N];
int n,m;
int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
int is_lake,once;

inline bool check(int x,int y)
{
return x>=0&&x<n&&y>=0&&y<m&&pos[x][y]=='.'&&!vis[x][y];
}
void dfs(int x,int y)
{
vis[x][y]=1;
++once;
if(x==0||y==0||x==n-1||y==m-1)
is_lake=0;
for (int i=0; i<4; ++i)
{
int xx=x+dir[i][0];
int yy=y+dir[i][1];
if(check(xx,yy))
dfs(xx,yy);
}
}
void kuosan(int x,int y)
{
pos[x][y]='*';
for (int i=0; i<4; ++i)
{
int xx=x+dir[i][0];
int yy=y+dir[i][1];
if(xx>=0&&xx<n&&yy>=0&&yy<m&&pos[xx][yy]=='.')
kuosan(xx,yy);
}
}
int main(void)
{
int i,j,k;
while (~scanf("%d%d%d",&n,&m,&k))
{
CLR(vis,0);
for (i=0; i<n; ++i)
scanf("%s",pos[i]);
int sc=0;
for (i=0; i<n; ++i)
{
for (j=0; j<m; ++j)
{
if(pos[i][j]=='.'&&!vis[i][j])
{
is_lake=1;
once=0;
dfs(i,j);
if(is_lake)
Q.push((info){once,i,j}),++sc;
}
}
}
int r=0;
info now;
while (sc>k)
{
now=Q.top();
Q.pop();
kuosan(now.x,now.y);
r+=now.need;
--sc;
}
printf("%d\n",r);
for (i=0; i<n; ++i)
printf("%s\n",pos[i]);
}
return 0;
}```

## Codeforces Round #375 (Div. 2)——D. Lakes in Berland（DFS连通块）的更多相关文章

1. Codeforces Round #375 (Div. 2) D. Lakes in Berland dfs

D. Lakes in Berland time limit per test 2 seconds memory limit per test 256 megabytes input standard ...

2. Codeforces Round #375 (Div. 2) D. Lakes in Berland 贪心

D. Lakes in Berland 题目连接: http://codeforces.com/contest/723/problem/D Description The map of Berland ...

3. Codeforces Round #375 (Div. 2) D. Lakes in Berland （DFS或并查集）

D. Lakes in Berland time limit per test 2 seconds memory limit per test 256 megabytes input standard ...

4. Codeforces Round #375 (Div. 2) D. Lakes in Berland 并查集

http://codeforces.com/contest/723/problem/D 这题是只能把小河填了,题目那里有写,其实如果读懂题这题是挺简单的,预处理出每一块的大小,排好序,从小到大填就行了 ...

5. Codeforces Round #375 (Div. 2)

A. The New Year: Meeting Friends 水 #include <set> #include <map> #include <stack> ...

6. Codeforces Round #375 (Div. 2) - D

题目链接:http://codeforces.com/contest/723/problem/D 题意:给定n*m小大的字符矩阵.'*'表示陆地,'.'表示水域.然后湖的定义是:如果水域完全被陆地包围 ...

7. Codeforces Round #375 (Div. 2) ABCDE

A - The New Year: Meeting Friends 水 #include<iostream> #include<algorithm> using namespa ...

8. Codeforces Round #375 (Div. 2) F. st-Spanning Tree 生成树

F. st-Spanning Tree 题目连接: http://codeforces.com/contest/723/problem/F Description You are given an u ...

9. Codeforces Round #375 (Div. 2) - C

题目链接:http://codeforces.com/contest/723/problem/C 题意:给定长度为n的一个序列.还有一个m.现在可以改变序列的一些数.使得序列里面数字[1,m]出现次数 ...

## 随机推荐

1. AutoMapper简明教程(学习笔记)

2. 在VS2012中采用C++中调用DLL中的函数 (4)

这两天因为需要用到VS2012来生成一个DLL代码,但是之前并没有用过DLL相关的内容,从昨天开始尝试调试DLL的文件调用,起初笔者在网络上找到了3片采用VSXXX版本进行调试的例子,相关的内容见本人 ...

3. 垃圾回收（GC）的三种基本方式

垃圾(Garbage)就是程序需要回收的对象,如果一个对象不在被直接或间接地引用,那么这个对象就成为了「垃圾」,它占用的内存需要及时地释放,否则就会引起「内存泄露」.有些语言需要程序员来手动释放内存( ...

4. js数组如何去掉逗号

技术水平比较差,有错误的地方或者大神们有好的方法在介绍下,可以指点出来我加以改正! 1.join去掉逗号',' var a = ['1', '2', '3', '4', '5']; var c = a ...

5. JS判断是否是移动设备进行http链接重定向

1.问题: 用户使用手机移动设备访问127.0.0.1/yemian,自动识别到手机端并且跳转至127.0.0.1/m/yemian 2.小二,上代码: //判断是否是移动设备 var ua = na ...

6. SAP OTR 字段维护 更改SAP的字段翻译

维护系统文本字段:SOTR_EDIT           TC:SE63 在SAP用户选择屏幕中,用鼠标选定一个栏位后按F1键,能够看到SAP对其详细解释,通常这样的解释文本分为两部分,一部分为标题, ...

7. Linux内核启动分析

张超<Linux内核分析>MOOC课程http://mooc.study.163.com/course/USTC-1000029000 我的代码可见https://www.shiyanlo ...

8. CPP--关于long的争议和思考

先普及一下VS开发Linux的知识点 VS2017的安装:https://www.cnblogs.com/dunitian/p/8051985.html 创建项目在这 第一次运行的时候会让输入服务器信 ...