Download Speed

#include <iostream>
#include <vector>
#include <algorithm>


int main(int argc, char **argv) {
    int n, m;
    std::cin >> n >> m;

    std::vector<std::vector<long long>> cap(n+1, std::vector<long long>(n+1, 0));

    for (int i=0; i<m; i++) {
        int a, b;
        long long c;
        std::cin >> a >> b >> c;
        cap[a][b] += c;
    }

    long long internet = 0;

    while (n > 0) {
        std::vector<int> parent(n+1, 0);
        std::vector<int> queue = {1};
        parent[1] = 1;

        for (int i=0; i<(int)queue.size(); i++) {
            int a = queue[i];
            for (int b=1; b<=n; b++) {
                if (parent[b] == 0 && cap[a][b] > 0) {
                    parent[b] = a;
                    queue.push_back(b);
                }
            }
        }

        if (parent[n] == 0) {
            break;
        }

        long long x = cap[parent[n]][n];
        for (int b=n; b!=1; b=parent[b]) {
            x = std::min(x, cap[parent[b]][b]);
        }

        for (int b=n; b!=1; b=parent[b]) {
            cap[parent[b]][b] -= x;
            cap[b][parent[b]] += x;
        }

        internet += x;
    }

    std::cout << internet << std::endl;

    return 0;
}

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