求助dalao dalao往这看 thanks

求助蒟蒻！！！

重打模板，TLE飞了

#include<bits/stdc++.h>
#define N 10005
#define M 200005 
using namespace std;
const int inf=1e9;
int n,m,cnt=1,maxflow,d[N],S,T;
int ver[M],nx[M],v[M],fi[N];
queue<int> q;

void add(int x,int y,int z){
    ver[++cnt]=y;nx[cnt]=fi[x];fi[x]=cnt;v[cnt]=z;
}

bool bfs(){
    memset(d,0,sizeof(d));
    q.push(S);
    d[S]=1;
    while(!q.empty()){
        int x=q.front();q.pop();
        for(int i=fi[x];i;i=nx[i])
            if(!d[ver[i]]&&v[i]){
                int y=ver[i];
                d[y]=d[x]+1;
                q.push(y);
                if(y==T)return 1;
            }
    }
    return 0;
}

int dfs(int x,int flow){
    if(x==T||!flow)return flow;
    int ans,res=flow;
    for(int i=fi[x],y=ver[i];i&&res;i=nx[i])
        if(v[i]&&d[y]==d[x]+1){
            ans=dfs(y,min(flow,v[i]));
            if(!ans)d[y]=0;
            v[i]-=ans;
            v[i^1]+=ans;
            res-=ans;
            if(!res)return flow;
        }
    return flow-res;
}

void dinic(){
    while(bfs())maxflow+=dfs(S,inf);
}

int main(){
    scanf("%d%d%d%d",&n,&m,&S,&T);
    for(int i=1;i<=m;i++){
        int a,b,c;scanf("%d%d%d",&a,&b,&c);
        add(a,b,c);add(b,a,0);
    }
    dinic();
    printf("%d",maxflow);
    return 0;
}