Skip to content

Commit cc99655

Browse files
committed
solved(python): baekjoon 1753
1 parent d50b42d commit cc99655

4 files changed

Lines changed: 101 additions & 0 deletions

File tree

baekjoon/python/1753/__init__.py

Whitespace-only changes.

baekjoon/python/1753/main.py

Lines changed: 44 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,44 @@
1+
import heapq
2+
import math
3+
import sys
4+
5+
from collections import defaultdict
6+
7+
read = lambda: sys.stdin.readline().rstrip()
8+
9+
10+
class Problem:
11+
def __init__(self):
12+
self.v, self.e = map(int, read().split())
13+
self.k = int(read())
14+
15+
self.graph = defaultdict(list)
16+
for start, end, distance in [map(int, read().split()) for _ in range(self.e)]:
17+
self.graph[start].append((end, distance))
18+
19+
def solve(self) -> None:
20+
distances = self.dijkstra()
21+
22+
for vertex in range(self.v):
23+
print(distances[vertex] if distances[vertex] != math.inf else "INF")
24+
25+
def dijkstra(self) -> list[float]:
26+
queue, distances = [(0, self.k)], [0 if idx == self.k else math.inf for idx in range(self.v + 1)]
27+
28+
while queue:
29+
current_distance, current_vertex = heapq.heappop(queue)
30+
31+
if current_distance > distances[current_vertex]:
32+
continue
33+
34+
for next_vertex, distance in self.graph[current_vertex]:
35+
next_distance = current_distance + distance
36+
if next_distance < distances[next_vertex]:
37+
distances[next_vertex] = next_distance
38+
heapq.heappush(queue, (next_distance, next_vertex))
39+
40+
return distances[1:]
41+
42+
43+
if __name__ == "__main__":
44+
Problem().solve()

baekjoon/python/1753/sample.json

Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
[
2+
{
3+
"input": [
4+
"5 6",
5+
"1",
6+
"5 1 1",
7+
"1 2 2",
8+
"1 3 3",
9+
"2 3 4",
10+
"2 4 5",
11+
"3 4 6"
12+
],
13+
"expected": [
14+
"0",
15+
"2",
16+
"3",
17+
"7",
18+
"INF"
19+
]
20+
}
21+
]

baekjoon/python/1753/test_main.py

Lines changed: 36 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,36 @@
1+
import json
2+
import os.path
3+
import unittest
4+
from io import StringIO
5+
from unittest.mock import patch
6+
7+
from parameterized import parameterized
8+
9+
from main import Problem
10+
11+
12+
def load_sample(filename: str):
13+
path = os.path.join(os.path.dirname(os.path.abspath(__file__)), filename)
14+
15+
with open(path, "r") as file:
16+
return [(case["input"], case["expected"]) for case in json.load(file)]
17+
18+
19+
class TestCase(unittest.TestCase):
20+
@parameterized.expand(load_sample("sample.json"))
21+
def test_case(self, case: str, expected: list[str]):
22+
# When
23+
with (
24+
patch("sys.stdin.readline", side_effect=case),
25+
patch("sys.stdout", new_callable=StringIO) as output,
26+
):
27+
Problem().solve()
28+
29+
result = output.getvalue().rstrip()
30+
31+
# Then
32+
self.assertEqual("\n".join(expected), result)
33+
34+
35+
if __name__ == "__main__":
36+
unittest.main()

0 commit comments

Comments
 (0)