#1312. USACO 2020 February Contest, Gold — Problem 3. Delegation

    ID: 1312 传统题 文件IO:deleg 2000ms 256MiB 尝试: 0 已通过: 0 难度: 提高+/省选- 上传者: 标签>USACO赛事:feb20来源:usaco.orgscoring:equal_test_cases树形DP深搜

USACO 2020 February Contest, Gold — Problem 3. Delegation

USACO 2020 February Contest, Gold — Problem 3. Delegation

题目描述

Farmer John's farm consists of NN pastures (2≤N≤1052 \leq N \leq 10^5) connected by N−1N-1 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 1≤K≤N−11 \leq K \leq N-1, help Farmer John determine whether the roads can be partitioned into paths of length exactly KK.

输入格式

The first line contains a single integer NN. The next N−1N-1 lines each contain two space-separated integers aa and bb describing an edge between vertices aa and bb. Each of aa and bb is in the range 1…N1 \ldots N.

输出格式

(见题面原文)

数据范围

In test cases 2-4 the tree forms a star; at most one vertex has degree greater than two. Test cases 5-8 satisfy N≤103N\le 10^3. 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