영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
There are n cities and m routes through which parcels can be carried from one city to another city. For each route, you know the maximum number of parcels and the cost of a single parcel.
You want to send k parcels from Syrjälä to Lehmälä. What is the cheapest way to do that?
Input
The first input line has three integers n, m and k: the number of cities, routes and parcels. The cities are numbered 1,2,…,n. City 1 is Syrjälä and city n is Lehmälä.
After this, there are m lines that describe the routes. Each line has four integers a, b, r and c: there is a route from city a to city b, at most r parcels can be carried through the route, and the cost of each parcel is c.
Output
Print one integer: the minimum total cost or -1 if there are no solutions.
Constraints
- 2 ≤ n ≤ 500
- 1 ≤ m ≤ 1000
- 1 ≤ k ≤ 100
- 1 ≤ a,b ≤ n
- 1 ≤ r,c ≤ 1000
Example
Explanation: One parcel is delivered through route 1 → 2 → 4 (cost 1 · 450=450) and two parcels are delivered through route 1 → 3 → 4 (cost 2 · 150=300).
예제
예제 1
4 5 3 1 2 5 100 1 3 10 50 1 4 7 500 2 4 8 350 3 4 2 100
750