벨만포드2 [백준] 1865번 - 웜홀 (파이썬) # 웜홀 import sys input = sys.stdin.readline MAX = sys.maxsize def bf(): for k in range(1, N+1): for i in range(1, N+1): for time, city in arr[i]: if times[city] > time + times[i]: times[city] = time + times[i] if k == N: return True return False T = int(input()) for _ in range(T): N, M, W = map(int, input().split()) arr = [[]for _ in range(N+1)] for _ in range(M): a, b, time = map(int, input().sp.. 2022. 2. 9. [백준] 11657번 - 타임머신 (파이썬) # 타임머신 import sys input = sys.stdin.readline MAX = sys.maxsize N, M = map(int, input().split()) bus = [] for _ in range(M): a, b, time = map(int, input().split()) bus.append((a, b, time)) dist = [MAX] * (N+1) def bf(start): dist[start] = 0 for k in range(N): for i in range(M): city, ncity, time = bus[i] if dist[city] != MAX and dist[ncity] > dist[city] + time: dist[ncity] = dist[city] + time if .. 2022. 2. 1. 이전 1 다음
