#PU1019. USACO 2020 February Contest, Gold — Problem 3. Delegation
USACO 2020 February Contest, Gold — Problem 3. Delegation
USACO 2020 February Contest, Gold — Problem 3. Delegation
题目描述
Farmer John's farm consists of pastures () connected by
roads, so that any pasture is reachable from any other pasture. That is,
the farm is a tree. But after 28 years of dealing with the tricky algorithmic
problems that inevitably arise from trees, FJ has decided that a farm in the
shape of a tree is just too complex. He believes that algorithmic problems are
simpler on paths.
Thus, his plan is to partition the set of roads into several paths, and delegate
responsibility for each path to a worthy farm hand. To avoid contention, he
wants each path to be the same length. He wonders for which lengths there exists
such a partition.
More precisely, for each , help Farmer John determine whether
the roads can be partitioned into paths of length exactly .
输入格式
The first line contains a single integer .
The next lines each contain two space-separated integers and
describing an edge between vertices and . Each of and is in the
range .
输出格式
(见题面原文)
数据范围
In test cases 2-4 the tree forms a star; at most one vertex has degree
greater than two.
Test cases 5-8 satisfy .
Test cases 9-15 satisfy no additional constraints..
样例
样例 1
13
1 2
2 3
2 4
4 5
2 6
6 7
6 8
8 9
9 10
8 11
11 12
12 13
111000000000
It is possible to partition this tree into paths of length $K$ for $K=1,2,3.$
For $K=3$, a possible set of paths is as follows:
$$13-12-11-8, 10-9-8-6, 7-6-2-3, 5-4-2-1$$
Problem credits: Mark Gordon and Dhruv Rohatgi