Ticket 16071
Problem 1715 -e
Submission 169246634
View hacks & all small testcases

Unable to dry run this testcase?
Try making a new request with small values of n_high, t_high, *_high, etc.


Retry
Input
This is a tree (a straight line with n  vertices and n - 1 edges).
Each edge is set to its max capacity).
Input truncated for brevity.

K is intentionally set to zero to verify Dijkstra.

100000 99999 0
1 2 1000000000
2 3 1000000000
3 4 1000000000
4 5 1000000000
5 6 1000000000
...
99995 99996 1000000000
99996 99997 1000000000
99997 99998 1000000000
99998 99999 1000000000
99999 100000 1000000000
Expected Output
0
1000000000
2000000000
3000000000
4000000000
...
99995000000000
99996000000000
99997000000000
99998000000000
99999000000000
Your Output
0
1000000000
2000000000
3000000000
4000000000
...
Line Number: 10^4 + 1 onwards
10000000000000
10000000000000
10000000000000
10000000000000
10000000000000

Difference
Generator Parameters
custom