Shortest Weighted Routes

Find the minimum total route cost from city 1 to each city. Routes are directed: [u, v, cost] allows travel from u to v, not automatically back. You may use several routes. City 1 costs 0 to reach. Every city is reachable from city 1.

Implement shortest_weighted_routes(cities, routes).

Input

cities: Number of cities, numbered from 1.

routes: Directed routes [from_city, to_city, cost].

Output

Return the minimum costs in city order, starting with city 1.

เงื่อนไข

1 ≤ cities ≤ 100,000. 0…200,000 routes; endpoints are 1…cities. Costs are integers from 1 to 1,000,000,000. Parallel routes and self-loops are allowed. Distances fit signed 64-bit.

ตัวอย่าง

อินพุต:
cities = 3
routes = [
    [1, 2, 5],
    [1, 3, 1],
    [3, 2, 2]
]

ผลลัพธ์ที่คาดหวัง:
expected = [0, 3, 1]

อินพุต:
long long cities = 3;
std::vector<std::vector<long long>> routes = {
    {1, 2, 5},
    {1, 3, 1},
    {3, 2, 2}
};

ผลลัพธ์ที่คาดหวัง:
std::vector<long long> expected = {0, 3, 1};

อินพุต:
long cities = 3;
long[][] routes = new long[][] {
    new long[] {1, 2, 5},
    new long[] {1, 3, 1},
    new long[] {3, 2, 2}
};

ผลลัพธ์ที่คาดหวัง:
long[] expected = new long[] {0, 3, 1};

อินพุต:
cities = 1
routes = []

ผลลัพธ์ที่คาดหวัง:
expected = [0]

อินพุต:
long long cities = 1;
std::vector<std::vector<long long>> routes = {};

ผลลัพธ์ที่คาดหวัง:
std::vector<long long> expected = {0};

อินพุต:
long cities = 1;
long[][] routes = new long[][] {};

ผลลัพธ์ที่คาดหวัง:
long[] expected = new long[] {0};

แหล่งอ้างอิง

โจทย์นี้ปรับให้เหมาะกับ CodeUtility กรุณาทำตามคำชี้แจงและข้อจำกัดด้านบน

• CSES: Shortest Routes I