Download Speed

import math
import sys
sys.setrecursionlimit(10**8)

def find_path(s, f, visited=None, path=None):
    global g, n
    if visited is None:
        visited = [False] * n
    if path is None:
        path = []

    path.append(s)
    visited[s] = True

    if s == f:
        return path

    for i, w in enumerate(g[s]):
        if not visited[i] and w > 0:
            res_path = find_path(i, f, visited=visited, path=path)
            if res_path:
                return res_path

    path.pop()
    return None

def ff(s, f):
    global g, n, paths
    res = 0

    path = find_path(s, f)
    while path:
        # print(*path)
        # print(g)
        min_flow = math.inf
        for i in range(len(path) - 1):
            a, b = path[i], path[i + 1]
            min_flow = min(min_flow, g[a][b])

        for i in range(len(path) - 1):
            a, b = path[i], path[i + 1]
            g[a][b] -= min_flow
            g[b][a] += min_flow

        res += min_flow

        path = find_path(s, f)

    return res


n, m = map(int, input().split())
g = [[0 for _ in range(n)] for _ in range(n)]
paths = []
for i in range(m):
    a, b, c = map(int, input().split())
    g[a - 1][b - 1] += c
res = ff(0, n - 1)
print(res)

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