Internet connection

#include <bits/stdc++.h>

using namespace std;

int n, m, s, t;
int inf = 999999999;
vector<int> a[100000];
int c[1000][1000];
int f[1000][1000];
int d[1000];

bool bfs(int s, int t) {
    queue<int> q;
    for (int i = 1; i <= n; i++)
        d[i] = 0;
    d[s] = inf;
    q.push(s);

    while (!q.empty()) {
        int u = q.front();
        q.pop();
        if (u == t)
            return true;
        for (int v : a[u])
            if (d[v] == 0 && c[u][v] > f[u][v]) {
                d[v] = u;
                q.push(v);
            }
    }
    return false;
}

void maxflow() {
    int u, v, diff = inf;
    for (v = t; v != s; v = d[v]) {
        u = d[v];
        if (diff > c[u][v] - f[u][v])
            diff = c[u][v] - f[u][v];
    }
    for (v = t; v != s; v = u) {
        u = d[v];
        f[u][v] += diff;
        f[v][u] -= diff;
    }
}

int main() {
    cin >> n >> m;
    s = 1;
    t = n;
    for (int i = 1; i <= m; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        a[u].push_back(v);
        a[v].push_back(u);
        c[u][v] = w;
    }
    while (bfs(s, t))
        maxflow();

    long long int ans = 0;
    for (int v : a[s])
        ans += f[s][v];
    printf("%lld", ans);
    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

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED