문제
Air Bovinia operates flights connecting the N farms that the cows live on
Currently, Air Bovinia offers M one-way flights (
Bessie is in charge of running the ticketing services for Air Bovinia. Unfortunately, while she was away chewing on delicious hay for a few hours, Q one-way travel requests for the cows' holiday vacations were received
As Bessie is overwhelmed with the task of processing these tickets, please help her compute whether each ticket request can be fullfilled, and its minimum cost if it can be done.
To reduce the output size, you should only output the total number of ticket requests that are possible, and the minimum total cost for them. Note that this number might not fit into a 32-bit integer.
입력
* Line 1: The integers N, M, K, and Q.
* Lines
* Lines
* Lines
출력
* Line 1: The number of ticket requests that can be fullfilled.
* Line 2: The minimum total cost of fulling the possible ticket requests
예제1
33 1 2
1 2 10
2 3 10
2 1 5
2
1 3
3 1
1
20
OUTPUT DETAILS:
For the first flight, the only feasible route is 1->2->3, costing 20. There are no flights leaving farm 3, so the poor cows are stranded there.