#PU1357. USACO 2023 December Contest, Platinum — Problem 2. A Graph Problem
USACO 2023 December Contest, Platinum — Problem 2. A Graph Problem
USACO 2023 December Contest, Platinum — Problem 2. A Graph Problem
题目描述
To improve her mathematical knowledge, Bessie has been taking a graph theory course and finds herself stumped by the following problem. Please help her! You are given a connected, undirected graph with vertices labeled and edges labeled (, ). For each vertex in the graph, the following process is conducted: Let and . While , Out of all edges with exactly one endpoint in , let be the edge with the minimum label. Add the endpoint of not in to . Set . Return . Determine all the return values of this process.
输入格式
The first line contains and . Then follow lines, the th containing the endpoints of the th edge (). It is guaranteed that these edges form a connected graph, and at most one edge connects each pair of vertices.
输出格式
(见题面原文)
数据范围
(见题面原文)
样例
样例 1
3 2
1 2
2 3
12
12
21
样例 2
5 6
1 2
3 4
2 4
2 3
2 5
1 5
1325
1325
2315
2315
5132
Consider starting at $i=3$. First, we choose edge $2$, after which
$S = \{3, 4\}$ and $h = 2$. Second, we choose edge $3$, after which
$S = \{2, 3, 4\}$ and $h = 23$. Third, we choose edge $1$, after which
$S = \{1, 2, 3, 4\}$ and $h = 231$. Finally, we choose edge $5$, after which
$S = \{1, 2, 3, 4, 5\}$ and $h = 2315$. The answer for $i=3$ is therefore
$2315$.
样例 3
15 14
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
10 11
11 12
12 13
13 14
14 15
678925929
678925929
678862929
678787329
678709839
678632097
178554320
218476543
321398766
431520989
542453212
653475435
764507558
875540761
986574081
Make sure to output the answers modulo $10^9+7$.