Download Speed

#include <bits/stdc++.h>
using namespace std;
struct Value{int u,cap;};const int MAX_N=512,INF=1e9+123;vector<int>g[MAX_N];vector<Value>egs;
void add_edge(int a,int b,int c){g[a].push_back(egs.size());egs.push_back({b,c});g[b].push_back(egs.size());egs.push_back({a,0});}
int bfs(int s,int t,vector<int>&parent) {
    fill(parent.begin(),parent.end(),-1);parent[s] = -2;
    queue<pair<int, int>>q;q.push({s,INF});
    while (!q.empty()) {
        int v = q.front().first,flow = q.front().second;
        q.pop();
        for (auto e:g[v]) {
            auto edge = egs[e];
            if (parent[edge.u] == -1 && edge.cap > 0) {
                parent[edge.u] = e;
                int new_flow = min(flow, edge.cap);
                if (edge.u == t) {
                    return new_flow;
                }
                q.push({edge.u, new_flow});
            }
        }
    }
    return 0;
}
long long maxflow(int s,int t,int n)
{
    long long flow=0;
    vector<int>parent(n);
    for(int new_flow=0;(new_flow=bfs(s,t,parent)) > 0;){
        flow += new_flow;
        for(int cur=t;cur!=s;){int e=parent[cur];egs[e].cap-=new_flow;egs[e^1].cap+=new_flow;cur=egs[e^1].u;}
    }
    return flow;
}
int n,m;
signed main() {
    cin>>n>>m;
    for(int i=0;i<m;i++){
        int a,b,c;
        cin>>a>>b>>c;
        a--;b--;
        add_edge(a,b,c);
    }
    cout<<maxflow(0, n - 1, n)<<'\n';
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED