POJ2226 Muddy Fields

 

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 10149		Accepted: 3783

Description

Rain has pummeled the cows' field, a rectangular grid of R rows and C columns (1 <= R <= 50, 1 <= C <= 50). While good for the grass, the rain makes some patches of bare earth quite muddy. The cows, being meticulous grazers, don't want to get their hooves dirty while they eat. 

To prevent those muddy hooves, Farmer John will place a number of wooden boards over the muddy parts of the cows' field. Each of the boards is 1 unit wide, and can be any length long. Each board must be aligned parallel to one of the sides of the field. 

Farmer John wishes to minimize the number of boards needed to cover the muddy spots, some of which might require more than one board to cover. The boards may not cover any grass and deprive the cows of grazing area but they can overlap each other. 

Compute the minimum number of boards FJ requires to cover all the mud in the field.

Input

* Line 1: Two space-separated integers: R and C 

* Lines 2..R+1: Each line contains a string of C characters, with '*' representing a muddy patch, and '.' representing a grassy patch. No spaces are present.

Output

* Line 1: A single integer representing the number of boards FJ needs.

Sample Input

4 4
*.*.
.***
***.
..*.

Sample Output

4

Hint

OUTPUT DETAILS: 

Boards 1, 2, 3 and 4 are placed as follows: 
1.2. 
.333 
444. 
..2. 
Board 2 overlaps boards 3 and 4.

Source

USACO 2005 January Gold

 

将连续的一段横/纵条算作同一个，若横纵条相交则连边，跑二分图匹配。

/*by SilverN*/
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector>
using namespace std;
const int mxn=1010;
int m,n;
char a[mxn][mxn];
//
int idx,idy;
int hs[mxn][mxn];
int link[mxn];
int mp[mxn][mxn];
bool vis[mxn];
//
void init(){
    int i,j;
    for(i=1;i<=n;i++){
        for(j=1;j<=m;j++){
            if(a[i][j]=='*'){
                ++idx;
                while(a[i][j]=='*')hs[i][j++]=idx;
            }
        }
    }
    idy=idx;
    for(j=1;j<=m;j++)
        for(i=1;i<=n;i++){
            if(a[i][j]=='*'){
                ++idy;
                while(a[i][j]=='*'){
                    mp[idy][hs[i][j]]=1;
                    mp[hs[i++][j]][idy]=1;
                }
            }
        }
    return;
}
bool DFS(int u){
    for(int i=1;i<=idy;i++)
        if(!vis[i] && mp[u][i]){
            vis[i]=1;
            if(link[i]==-1 || DFS(link[i])){
                link[i]=u;
                return 1;
            }
        }
    return 0;
}
int ans=0;
void solve(){
    memset(link,-1,sizeof link);
    for(int i=1;i<=idx;i++){
        memset(vis,0,sizeof vis);
        if(DFS(i))ans++;
    }
    return;
}
int main(){
    scanf("%d%d",&n,&m);
    int i,j;
    for(i=1;i<=n;i++)
        scanf("%s",a[i]+1);
    init();
    solve();
    printf("%d\n",ans);
    return 0;
}