12192, 12193번: Taking Metro - 최단 경로(다익스트라)
https://www.acmicpc.net/problem/12192 12192번: Taking Metro (Small) For each test case, output one line containing "Case #x:", where x is the test case number (starting from 1), then followed by Q lines, each line containing an integer y which is the shortest time you need for that query. If it's impossible, output -1 for www.acmicpc.net https://www.acmicpc.net/problem/12193 12193번: Taking Metro ..
알고리즘/baekjoon
2023. 5. 30. 09:53
