F - Lakes in Berland(BFS)
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 klakes 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 n, m 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.
Example
5 4 1
****
*..*
****
**.*
..**
1
****
*..*
****
****
..**
3 3 0
***
*.*
***
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.
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 #include <iostream> 2 #include <cstdio> 3 #include <algorithm> 4 #include <cstring> 5 #include <map> 6 using namespace std; 7 typedef long long ll; 8 const int N=55; 9 inline int read(){ 10 char c=getchar();int x=0,f=1; 11 while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();} 12 while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();} 13 return x*f; 14 } 15 int n,m,k; 16 char g[N][N]; 17 int dx[4]={1,-1,0,0},dy[4]={0,0,1,-1}; 18 int vis[N][N],num[N*N],cc=0; 19 struct lakes{ 20 int size,id; 21 }lake[N*N]; 22 int cnt=0; 23 bool cmp(lakes &a,lakes &b){ 24 return a.size<b.size; 25 } 26 void dfs(int x,int y,int id){//printf("dfs %d %d %d\n",x,y,id); 27 vis[x][y]=id;num[id]++; 28 for(int i=0;i<4;i++){ 29 int nx=x+dx[i],ny=y+dy[i]; 30 if(nx<1||nx>n||ny<1||ny>m) continue; 31 if(g[nx][ny]=='*'||vis[nx][ny]) continue; 32 dfs(nx,ny,id); 33 } 34 } 35 int ans=0; 36 void fil(int x,int y,int id){//printf("fil %d %d %d\n",x,y,id); 37 g[x][y]='*';ans++; 38 for(int i=0;i<4;i++){ 39 int nx=x+dx[i],ny=y+dy[i]; 40 if(nx<1||nx>n||ny<1||ny>m) continue; 41 if(vis[nx][ny]==id&&g[nx][ny]=='.') fil(nx,ny,id); 42 } 43 } 44 int main(){ 45 n=read();m=read();k=read(); 46 for(int i=1;i<=n;i++){ 47 scanf("%s",g[i]); 48 for(int j=m;j>=1;j--) g[i][j]=g[i][j-1]; 49 } 50 51 for(int i=1;i<=n;i++){ 52 if(!vis[i][1]&&g[i][1]=='.') dfs(i,1,++cc); 53 if(!vis[i][m]&&g[i][m]=='.') dfs(i,m,++cc); 54 } 55 for(int j=1;j<=m;j++){ 56 if(!vis[1][j]&&g[1][j]=='.') dfs(1,j,++cc); 57 if(!vis[n][j]&&g[n][j]=='.') dfs(n,j,++cc); 58 } 59 int sea=cc; 60 for(int i=1;i<=n;i++) 61 for(int j=1;j<=m;j++){ 62 if(!vis[i][j]&&g[i][j]=='.') 63 dfs(i,j,++cc); 64 } 65 for(int i=sea+1;i<=cc;i++) {lake[++cnt].size=num[i];lake[cnt].id=i;}//printf("%d %d\n",sea,cc); 66 sort(lake+1,lake+1+cnt,cmp); 67 //for(int i=1;i<=cnt;i++) printf("lake %d %d\n",lake[i].id,lake[i].size); 68 int t=cnt-k,p=1;//printf("t %d\n",t); 69 for(int z=1;z<=t;z++){ 70 int fin=0; 71 for(int i=1;i<=n;i++){ 72 for(int j=1;j<=m;j++) 73 if(lake[p].id==vis[i][j]){fil(i,j,lake[p++].id);fin=1;break;} 74 if(fin) break; 75 } 76 } 77 printf("%d\n",ans); 78 for(int i=1;i<=n;i++){ 79 for(int j=1;j<=m;j++) printf("%c",g[i][j]); 80 if(i!=n) putchar('\n'); 81 } 82 83 }
相关文章
- Summary: Lowest Common Ancestor in a Binary Tree & Shortest Path In a Binary Tree
- UTF-8 BOM adventures in C#
- How do I UPDATE from a SELECT in SQL Server?
- 报错:Exception in thread "main" com.typesafe.config.ConfigException$UnresolvedSubstitution
- 解决twisted客户端连接过多导致崩溃问题(too many file descriptors in select)
- C#中ref、out、in的区别与使用
- Informix 启动 Fatal error in shared memory initialization解决方法
- ora-01653: unable to extend table sys.aud$ by 8192 in tablespac system[转载]
- ANY 和 IN 查询价格大于或等于"超级本"价格的商品,并且按价格降序排列
- flink error Hadoop is not in the classpath/dependencies.
- java.net.BindException: Address already in use: JVM_Bind
- SQL Server-聚焦EXISTS AND IN性能分析(十六)
- gevent.hub.BlockingSwitchOutError: Impossible to call blocking function in the event loop callback
- uwsgi启动Django项目时:unable to load app 0 (mountpoint='') (callable not found or import error) *** no app loaded. going in full dynamic mode ***
- [CareerCup] 4.6 Find Next Node in a BST 寻找二叉搜索树中下一个节点
- How to load jars residing over NFS in JBossAS7 classpath ? --reference
- Using JAAS Authentication in Java Clients---weblogic document
- 438. Find All Anagrams in a String