Dinic板子 全部TLE

#include<queue>
#include<cstdio>
#include<cstring>
using namespace std;
const int M=10010;

struct node{
	int to,next,flow;
}edge[M*100];
int head[M],cnte=1;
void add(int u,int v,int w){
	edge[++cnte].to=v;
	edge[cnte].flow=w;
	edge[cnte].next=head[u];
	head[u]=cnte;
}

int n,m,s,t,dis[M];
bool bfs(){
	memset(dis,0,sizeof dis);
	dis[s]=1;
	queue<int>q;
	q.push(s);
	while(!q.empty()){
		int u=q.front();q.pop();
		for(int i=head[u];~i;i=edge[i].next){
			int v=edge[i].to;
			if(edge[i].flow>0&&!dis[v]){
				dis[v]=dis[u]+1;
				q.push(v);
			}
		}
	}
	return dis[t];
}

int dfs(int u,int in){
	if(u==t) return in;
	int out=0;
	for(int i=head[u];~i&&in;i=edge[i].next){
		int v=edge[i].to;
		if(edge[i].flow>0&&dis[v]==dis[u]+1){
			int res=dfs(v,min(in,edge[i].flow));
			edge[i].flow-=res,edge[i^1].flow+=res;
			in-=res,out+=res;
		}
	}
	if(!out) dis[u]=-2020150;
	return out;
}

const int inf=2147483647;
const int dx[]={-1,1,0,0},
		  dy[]={0,0,-1,1};

int Dinic(){
	int ans=0;
	while(bfs()) ans+=dfs(s,inf);
	return ans;
}

int id(int x,int y){
	return (x-1)*m+y;
}

int main(){
	memset(head,-1,sizeof head);
	scanf("%d%d",&n,&m);
	s=0,t=n*m+1;
	for(int i=1;i<=n;i++)
		for(int j=1,a;j<=m;j++){
			scanf("%d",&a);
			if(a==1) add(s,id(i,j),inf),add(id(i,j),s,0);
			if(a==2) add(id(i,j),t,inf),add(t,id(i,j),0);
		}
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			for(int k=0;k<4;k++){
				int xx=i+dx[k],yy=j+dy[k];
				if(xx>=1&&xx<=n&&yy>=1&&yy<=m) add(id(i,j),id(xx,yy),1);
			}
	printf("%d",Dinic());
	return 0;
}