Download Speed

from collections import deque
 
# BFS function to check if there is a path from node 1 to node n with minimum speed 'minSpeed'
def bfs(n, minSpeed, adj):
    visited = [False] * (n + 1)
    queue = deque([1])  # Start from the server (node 1)
    visited[1] = True
    
    while queue:
        node = queue.popleft()
        
        if node == n:
            return True  # Reached Kotivalo's computer (node n)
        
        for neighbor, speed in adj[node]:
            if not visited[neighbor] and speed >= minSpeed:
                visited[neighbor] = True
                queue.append(neighbor)
    
    return False
 
def max_download_speed(n, m, connections):
    adj = [[] for _ in range(n + 1)]  # Adjacency list to store connections
    
    # Fill adjacency list with connections
    maxSpeed = 0
    for a, b, c in connections:
        adj[a].append((b, c))
        adj[b].append((a, c))  # Bidirectional connections
        maxSpeed = max(maxSpeed, c)
    
    # Binary search for the maximum possible minimum speed
    low, high = 1, maxSpeed
    result = 0
    
    while low <= high:
        mid = (low + high) // 2
        
        # Check if there is a valid path with at least 'mid' bandwidth using BFS
        if bfs(n, mid, adj):
            result = mid  # Found a valid path, try for a higher speed
            low = mid + 1
        else:
            high = mid - 1  # No valid path, try for a lower speed
    
    return result
 
# Input reading and handling
if __name__ == "__main__":
    n, m = map(int, input().split())  # Number of computers and connections
    connections = [tuple(map(int, input().split())) for _ in range(m)]  # Connections
    
    # Output the result
    print(max_download_speed(n, m, connections))

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