Download Speed

import heapq
 
def max_bandwidth(n, m, connections):
    adj = [[] for _ in range(n + 1)]
    
    # Build the adjacency list
    for a, b, c in connections:
        adj[a].append((b, c))
        adj[b].append((a, c))  # undirected graph
 
    # Dijkstra's algorithm with max-heap to maximize the minimum bandwidth
    max_bandwidth = [0] * (n + 1)
    max_bandwidth[1] = float('inf')  # Starting from node 1 with infinite bandwidth
    pq = [(-float('inf'), 1)]  # (bandwidth, node), using negative to simulate max-heap
 
    while pq:
        bw, node = heapq.heappop(pq)
        bw = -bw  # Convert back to positive value
        if bw < max_bandwidth[node]:
            continue
 
        # Traverse all the neighbors
        for neighbor, edge_bw in adj[node]:
            new_bw = min(bw, edge_bw)
            if new_bw > max_bandwidth[neighbor]:
                max_bandwidth[neighbor] = new_bw
                heapq.heappush(pq, (-new_bw, neighbor))
 
    return max_bandwidth[n]
 
# Input
n, m = map(int, input().split())
connections = [tuple(map(int, input().split())) for _ in range(m)]
 
# Find the maximum bandwidth path
result = max_bandwidth(n, m, connections)
print(result)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: ACCEPTED

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER