题目来源:http://poj.org/problem?id=3268
H: Silver Cow Party
总时间限制: 2000ms 内存限制: 65536kB
描述
One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow partyto be held at farm #X (1≤ X ≤ N).A total of M (1 ≤ M ≤ 100,000) unidirectional (one-wayroads connects pairs of farms; road i requires Ti (1 ≤ Ti ≤ 100) units of time to traverse.
Each cow mus