Download Speed

import sys
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations, product, accumulate, groupby
from functools import lru_cache, cmp_to_key, reduce
from math import gcd, isqrt, comb, inf, pi, sqrt, atan2, hypot


def main():
    data = sys.stdin.buffer.read().split(); idx = 0
    # n = int(data[idx]); idx += 1
    n, m = map(int, data[idx:idx + 2]); idx += 2
    # a = list(map(int, data[idx:idx + n])); idx += n
    # s = data[idx].decode(); idx += 1                  # strings


    edges = [[] for _ in range(n+1)]
    to = []
    cap = []
    for _ in range(m):
        a, b, c = map(int, data[idx:idx + 3]); idx += 3
        edges[a].append(len(to));
        to.append(b)
        cap.append(c)
        edges[b].append(len(to));
        to.append(a)
        cap.append(0)




    out = []
    if n <= 1:
        print("0")
        return

    total = 0
    while True:
        # BFS on the residual graph; pe[v] = edge used to reach v
        fromm = [-1] * (n + 1)
        fromm[1] = -2
        dq = deque([1])
        while dq and fromm[n] == -1:
            u = dq.popleft()
            for e in edges[u]:
                v = to[e]
                if cap[e] > 0 and fromm[v] == -1:
                    fromm[v] = e
                    dq.append(v)
        if fromm[n] == -1:
            break

        # bottleneck: walk back from n to 1
        f = inf
        v = n
        while v != 1:
            e = fromm[v]
            if cap[e] < f:
                f = cap[e]
            v = to[e ^ 1]          # tail of edge e

        # push flow
        v = n
        while v != 1:
            e = fromm[v]
            cap[e] -= f
            cap[e ^ 1] += f
            v = to[e ^ 1]

        total += f

    out = [total]




    sys.stdout.write("\n".join(map(str, out)) + "\n")  # one value per line


main()

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