#PU1354. USACO 2023 December Contest, Gold — Problem 2. Minimum Longest Trip
USACO 2023 December Contest, Gold — Problem 2. Minimum Longest Trip
USACO 2023 December Contest, Gold — Problem 2. Minimum Longest Trip
题目描述
Bessie is going on a trip in Cowland, which has () towns numbered from to and () one-way roads. The th road runs from town to town and has label (, ). A trip of length starting at town is a sequence of towns , such that there is a road from town to town for all . It is guaranteed that there are no trips of infinite length in Cowland, and that no two roads connect the same pair of towns. For each town, Bessie wants to know the longest possible trip starting at it. For some starting towns, there are multiple longest trips - out of these, she prefers the trip with the lexicographically minimum sequence of road labels. A sequence is lexicographically smaller than another sequence of the same length if, at the first position in which they differ, the first sequence has a smaller element than the second sequence.
输入格式
The first line contains and . The next lines each contain three integers , , and , denoting a road from to with label .
输出格式
(见题面原文)
数据范围
Inputs 5-6: All labels are the same. Inputs 7-8: All labels are distinct. Inputs 9-10: Inputs 11-20: No additional constraints. Problem credits: Claire Zhang and Spencer Compton
样例
样例 1
4 5
4 3 10
4 2 10
3 1 10
2 1 10
4 1 10
0 0
1 10
1 10
2 20
样例 2
4 5
4 3 4
4 2 2
3 1 5
2 1 10
4 1 1
0 0
1 10
1 5
2 12
In the following explanation, we let $a_i\overset{l_i}\to b_i$ represent the
road from $a_i$ to $b_i$ with label $l_i$.
There are several trips starting from vertex $4$, including
$4 \overset{4}\to 3\overset{5}\to 1$, $4\overset{1}\to 1$, and
$4\overset{2}\to 2\overset{10}\to 1$. Of these trips,
$4 \overset{4}\to 3\overset{5}\to 1$ and $4\overset{2}\to 2\overset{10}\to 1$
are the longest. These trips each have length 2, and their road label sequences
are $[4,5]$ and $[2,10]$, respectively. $[2,10]$ is the lexicographically
smaller sequence, and its sum is $12$.
样例 3
4 5
4 3 2
4 2 2
3 1 5
2 1 10
4 1 1
0 0
1 10
1 5
2 7
样例 4
4 5
4 3 2
4 2 2
3 1 10
2 1 5
4 1 1
0 0
1 5
1 10
2 7