第5个点WA，求dalao看下，orz

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
const int MAX=1e6;

inline int readInt(void){
    int num=0;char c=getchar();
    while(c<'0'||c>'9'){c=getchar();}
    while(c>='0'&&c<='9'){num=num*10+c-48;c=getchar();}
    return num;
} 

int cnt=0;
int nex[MAX+10]; 
int hed[MAX+10];
int pow[MAX+10];
int nod[MAX+10];
inline void addEdge(int u,int v,int p){
    nex[++cnt]=hed[u];hed[u]=cnt;nod[cnt]=v;pow[cnt]=p;
    nex[++cnt]=hed[v];hed[v]=cnt;nod[cnt]=u;pow[cnt]=0;
}

int n,m,s,t;
int vis[MAX+10];

void read(void);
void solve(void);
int DFS(int,int,int);

int main(void){
    read();
    solve();
    return 0;
}

void read(void){
    n=readInt();m=readInt();s=readInt();t=readInt();
    for(int i=1;i<=m;i++){
        int u=readInt();int v=readInt();int p=readInt();addEdge(u,v,p);
    } 

}
void solve(void){
    int flo=0;
    while(true){
        memset(vis,0,sizeof(vis));
        int f=DFS(s,t,MAX);
        if(f==0) {printf("%d",flo);return;}
        flo+=f;
    }
}
int DFS(int cur,int t,int f){
    if(cur==t) return f;
    vis[cur]=1;
    for(int i=hed[cur];i;i=nex[i]){
        if(i%2==0) continue;
        if(vis[nod[i]]==0&&pow[i]>0){
            int d=DFS(nod[i],t,min(f,pow[i]));
            if(d>0){
                pow[i]-=d;
                pow[i^1]+=d;
                return d;
            }
        }
    }
    return 0;
}