a, b를 하나로 통합해도 될 듯 합니다 !

[5Hyeons]

CodingStudy/합승 택시 요금/YooRiChae.py

Lines 29 to 34 in 9745acd

	for i in range(1, n+1):
	a_distance = [INF] * (n + 1)
	b_distance = [INF] * (n + 1)
	dijkstra(i, graph, a_distance)
	dijkstra(i, graph, b_distance)
	answer.append(s_distance[i]+a_distance[a]+b_distance[b])