Download Speed

#include <iostream>
#include <queue>
#include <vector>
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<long long>> cap(n + 1, vector<long long>(n + 1, 0));
    vector<vector<int>> adj(n + 1);
    for (int i = 0; i < m; i++) {
        int a, b;
        long long c;
        cin >> a >> b >> c;
        if (cap[a][b] == 0 && cap[b][a] == 0) {
            adj[a].push_back(b);
            adj[b].push_back(a);
        }
        cap[a][b] += c;
    }
    long long flow = 0;
    while (true) {
        vector<int> par(n + 1, 0);
        par[1] = 1;
        queue<int> q;
        q.push(1);
        while (!q.empty() && !par[n]) {
            int u = q.front();
            q.pop();
            for (int v : adj[u]) {
                if (!par[v] && cap[u][v] > 0) {
                    par[v] = u;
                    q.push(v);
                }
            }
        }
        if (!par[n]) break;
        long long add = 4e18;
        for (int v = n; v != 1; v = par[v]) add = min(add, cap[par[v]][v]);
        for (int v = n; v != 1; v = par[v]) {
            cap[par[v]][v] -= add;
            cap[v][par[v]] += add;
        }
        flow += add;
    }
    cout << flow;
}

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