Long Chain (longchain)
7 teams scored 325 points on this task, for a maximum score of 100, an average score of 46 and a median score of 20.
Highlights
- Banfi, Vimercate is the institute with the most points (100).
- Lombardia is the region with the most points (200).
Statement
You are given a tree with N vertices, numbered from 1 to N (a tree is an undirected connected graph in which there are no cycles). You are asked to partition it into edge-disjoint simple paths such that the length of the shortest one is maximized. In this task, the length of a path is defined as the number of edges it has.
Rank
Team
Institute
Region
Score
