AtCoder Regular Contest 074F Lotus Leaves 最小割

Solution

---

一个非常显然的做法就是我们拆点，然后连边跑最小割。这样边数是2(n²m+m²n)的，好像只会T一个点

另外一个非常显然的做法就是我们按行列建二分图，那么点就变成边的限制了，这样边数是2nm的，非常优秀

Code

---

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <queue>

#define rep(i,st,ed) for (register int i=st;i<=ed;++i)
#define fill(x,t) memset(x,t,sizeof(x))

const int INF=0x3f3f3f3f;
const int N=405;
const int E=200505;

struct edge {int y,w,next;} e[E];

int id[N][N],dis[N],ls[N],cur[N],tot,edCnt=1;

char rc[N][N];

void add_edge(int x,int y,int w) {
	e[++edCnt]=(edge) {y,w,ls[x]}; ls[x]=edCnt;
	e[++edCnt]=(edge) {x,0,ls[y]}; ls[y]=edCnt;
}

bool bfs(int st,int ed) {
	std:: queue <int> que;
	fill(dis,0); dis[st]=1;
	for (que.push(st);!que.empty();) {
		int x=que.front(); que.pop();
		for (int i=ls[x];i;i=e[i].next) {
			if (e[i].w&&dis[e[i].y]==0) {
				dis[e[i].y]=dis[x]+1;
				if (e[i].y==ed) return true;
				que.push(e[i].y);
			}
		}
	}
	return false;
}

int find(int x,int ed,int mn) {
	if (x==ed||!mn) return mn;
	int ret=0;
	for (int &i=cur[x];i;i=e[i].next) {
		if (e[i].w&&dis[x]+1==dis[e[i].y]) {
			int d=find(e[i].y,ed,std:: min(e[i].w,mn-ret));
			e[i].w-=d,e[i^1].w+=d,ret+=d;
			if (mn==ret) break;
		}
	}
	return ret;
}

int dinic(int st,int ed) {
	int res=0;
	for (;bfs(st,ed);) {
		rep(i,st,ed) cur[i]=ls[i];
		res+=find(st,ed,INF);
	}
	return res;
}

int main(void) {
	freopen("data.in","r",stdin);
	int n,m; scanf("%d%d",&n,&m);
	int sx,sy,tx,ty;
	rep(i,1,n) scanf("%s",rc[i]+1);
	rep(i,1,n) rep(j,1,m) {
		if (rc[i][j]!='.') id[i][j]=++tot;
	}
	rep(i,1,n) rep(j,1,m) if (rc[i][j]!='.') {
		if (rc[i][j]=='S') sx=i,sy=j;
		else if (rc[i][j]=='T') tx=i,ty=j;
		else {
			// add_edge(id[i][j],id[i][j]+tot,1);
			add_edge(i,j+n,1);
			add_edge(j+n,i,1);
		}
	}
	if (sx==tx||sy==ty) return 0&puts("-1");
	add_edge(0,sx,INF),add_edge(0,sy+n,INF);
	add_edge(tx,n+m+1,INF),add_edge(ty+n,n+m+1,INF);
	printf("%d\n", dinic(0,n+m+1));
	return 0;
}