Airport

import heapq
n,m = [int(x) for x in input().split()]
hall_capacity = [int(x) for x in input().split()]
neighbors = []

for i in range(n):
    neighbors.append([])

for i in range (m):
    a,b = [int(x) for x in input().split()]
    neighbors[a-1].append(b-1)



def find_path():
    priority_queue = []
    heapq.heappush(priority_queue,[0,[-1,0]]) # tuple  = (distance,current_node) 
    path = [-1 for i in range (n)]

    while priority_queue:
        dist,nodes = heapq.heappop(priority_queue)
        previous_node,node = nodes
        while path[node]!=-1 and priority_queue: 
            dist,nodes = heapq.heappop(priority_queue)
            previous_node,node = nodes
        if path[node]!=-1:
            #ON TROUVE PAS DE CHEMIN
            return [],0
        
        path[node]=previous_node

        for neigh in neighbors[node]:
            if path[neigh] == -1 and hall_capacity[neigh] != 0:
                if neigh == n-1 :
                    curr_node = n-1
                    if hall_capacity[curr_node] <= -1:
                        min_value = float('inf')
                    else:
                        min_value = hall_capacity[curr_node]
                    path[n-1]=node
                    chemin = []
                    while curr_node != -1:
                        chemin.append(curr_node)
                        if hall_capacity[curr_node] <= -1: capacity = float('inf')
                        else:  capacity = hall_capacity[curr_node]
                        min_value = min(capacity,min_value)
                        curr_node = path[curr_node]
                    return chemin[::-1],min_value
                new_dist = dist + 1
                heapq.heappush(priority_queue,[new_dist,[node,neigh]])
    return [],0


def sub_mini_from_path(path,mini):
    for i in range(len(path)):
        hall_capacity[path[i]]-=mini



curr_path,mini = find_path()

total_flow = mini
while curr_path:


    sub_mini_from_path(curr_path,mini)
    curr_path,mini = find_path()

    total_flow+=mini

print(total_flow)

Test 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED