网络流EK算法求助，8， 9，10点WA了

RT 加了long long的

#include <bits/stdc++.h>
using namespace std;
long long n , m , s , t , ans;
long long pre[210] , dis[210][210] , vis[210] , minn[210];
vector<int> e[210];
bool bfs(){
    memset(vis , 0 , sizeof(vis));
    queue<int> q;
    vis[s] = 1;
    q.push(s);
    minn[s] = 0x3ffffffffff;
    while(!q.empty()){
        int x = q.front();
        q.pop();
        for(int i = 0; i < e[x].size(); i++){
            int nx = e[x][i];
            if(dis[x][nx]){
                if(vis[nx]) continue;
                minn[nx] = min(minn[x] , dis[x][nx]);
                pre[nx] = x;
                q.push(nx);
                vis[nx] = 1;
                if(nx == t) return 1;
            }
        }
    }
    return 0;
}
void update(){
    int x = t;
    while(x != s){
        int px = pre[x];
        dis[x][px] += minn[t];
        dis[px][x] -= minn[t];
        x = px;
    }
    ans += minn[t];
}
int main(){
    cin >> n >> m >> s >> t;
    for(int i = 1; i <= m; i++){
        int x , y;
        long long z;
        cin >> x >> y >> z;
        e[x].push_back(y);
        dis[x][y] = z;
        e[y].push_back(x);
    }
    while(bfs()) update();
    cout << ans;
    return 0;
}