P2825 [HEOI2016/TJOI2016]游戏

思路是从左到右 从上到下 把 每一个连续的***XXX当作一个区域 然后 从上到下 从左到右 把 连续的 ***xxx当作一个区域 然后 区域对区域连边 跑最大流即可

#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
#define INF 0x3f3f3f3f

using namespace std;

const int N = 2650,M = N * N * 2,G = 60;

int head[N],to[M],last[M],w[M],cnt = 1;
void add(int a,int b,int c){
    to[++cnt] = b;
    w[cnt] = c;
    last[cnt] = head[a];
    head[a] = cnt;
    to[++cnt] = a;
    w[cnt] = 0;
    last[cnt] = head[b];
    head[b] = cnt;
}
int n,m;
char a[G][G];

int shu[G][G],heng[G][G];
int S,T;

int d[N],cur[N];
bool bfs(){
    memset(d,0,sizeof d);
    queue<int>q;
    q.push(S);cur[S] = head[S],d[S] = 1;
    while(q.size()){
        int p = q.front();
        q.pop();
        for(int i = head[p]; i != -1; i = last[i]){
            int j = to[i];
            if(w[i] && !d[j]){
                d[j] = d[p] + 1;
                cur[j] = head[j];
                q.push(j);
            }
        }
    }

    if(d[T]) return true;
    return false;
}

int dfs(int x,int sum){
    if(x == T) return sum;
    int used = 0;
    for(int i = cur[x]; i != -1; i = last[i]){
        int j = to[i];
        cur[x] = i;
        if(d[j] == d[x] + 1 && w[i]){
            int dd = dfs(j,min(sum - used,w[i]));
            used += dd;
            w[i] -= dd;
            w[i ^ 1] += dd;
        }
    }
    if(used == 0) d[x] = -1;
    return used;
}

int dinic(){
    int sum = 0;
    while(bfs()){
        sum += dfs(S,INF);
    }
    return sum;
}

int main(){
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> a[i][j];
        }
    }

    memset(head,-1,sizeof head);
    S = 0;
    int x = 1,y = 1,ans1 = 1;
    while(y != m + 1){
        if(a[x][y] != '#'){
            shu[x][y] = ans1;
        }
        else ++ans1;
        if(x + 1 <= n) x++;
        else{
            x = 1,y++;
            ++ans1;
        }
    }

    int ans2 = 1;
    x = 1,y = 1;
    while(x != n + 1){
        if(a[x][y] != '#'){
            heng[x][y] = ans2;
        }
        else ++ans2;
        if(a[x][y] == '*'){
            add(heng[x][y] + ans1,shu[x][y],1);
        }
        if(y + 1 <= m) y++;
        else{
            x++,y = 1;
            ++ans2;
        }
    }

    T = (ans1 + ans2 + 1);
    for(int i = 1; i <= ans2; i++){
        add(S,i + ans1,1);
    }
    for(int i = 1; i <= ans1; i++){
        add(i,T,1);
    }



    cout << dinic() << endl;




    return 0;
}