Codeforces_723_D

http://codeforces.com/problemset/problem/723/D

dfs找出每个湖，保存坐标和大小，按大小排序，填充湖即可，注意湖的数量最多会有1250个。

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define INF 0x3f3f3f3f
using namespace std;

int n,m,k,dir[][] = {-,,,-,,,,},ok,cnt = ,sizee,vis[][] = {};
char mp[][];

struct lake
{
    int x,y,cnt;
}l[];

bool cmp(struct lake a,struct lake b)
{
    return a.cnt < b.cnt;
}

void dfs1(int x,int y)
{
    vis[x][y] = ;
    sizee++;
    for(int i = ;i < ;i++)
    {
        int xx = x+dir[i][],yy = y+dir[i][];
        if(xx <  || yy <  || xx >= n || yy >= m)
        {
            ok = ;
            continue;
        }
        if(mp[xx][yy] == '*' || vis[xx][yy])    continue;

        dfs1(xx,yy);
    }
}

void dfs2(int x,int y)
{
    mp[x][y] = '*';
    for(int i = ;i < ;i++)
    {
        int xx = x+dir[i][],yy = y+dir[i][];
        if(xx <  || yy <  || xx >= n || yy >= m)    continue;
        if(!vis[xx][yy])    continue;
        vis[xx][yy] = ;
        dfs2(xx,yy);
    }
}

int main()
{
    scanf("%d%d%d",&n,&m,&k);
    getchar();
    int x = ;
    while(gets(mp[x++]));
    for(int i = ;i < n;i++)
    {
        for(int j = ;j < m;j++)
        {
            sizee = ;
            ok = ;
            if(mp[i][j] == '.' && !vis[i][j])
            {
                dfs1(i,j);
                if(ok)
                {
                    l[cnt].x = i;
                    l[cnt].y = j;
                    l[cnt++].cnt = sizee;
                }
            }
        }
    }
    sort(l,l+cnt,cmp);
    int endd = cnt-k,ans = ;
    for(int i = ;i < endd;i++)
    {
        ans += l[i].cnt;
        dfs2(l[i].x,l[i].y);
    }
    printf("%d\n",ans);
    for(int i = ;i < n;i++)    puts(mp[i]);
    return ;
}