CCO '13 P3 - LHC - DMOJ: Modern Online Judge

CCO '13 P3 - LHC

View as PDF

Submit solution

All submissions

Best submissions

Points: 12 (partial)

Time limit: 2.5s

Memory limit: 1G

Problem type

Canadian Computing Competition: 2013 Stage 2, Day 1, Problem 3

For your latest top-secret experiment, you will need a large quantity of Higgs bosons. To obtain these elusive particles, you will need to build a large hadron collider, a long circular tunnel that you can use to accelerate particles and smash them into each other.

You already have access to an extensive network of tunnels, which is guaranteed to be connected and free of cyclic paths. In other words, the existing tunnels form a tree structure. This system can be represented by $N$ $N$ junctions, labelled $1$ $1$ through $N$ $N$ , connected by $N - 1$ $N - 1$ tunnels, each of which connects two junctions. Tunnels can be traversed in either direction (i.e., if there is a junction from $a$ $a$ to $b$ $b$ , that junction also goes from $b$ $b$ to $a$ $a$ ).

By adding exactly one tunnel to the network, you can create a cyclic path, which you will use to build your large hadron collider. You wish to form the longest possible collider in this way, where we define length as the number of tunnels in a cycle. Also, you would like to compute the number of ways to do this– that is, the number of distinct pairs of junctions such that adding a tunnel between them forms a cycle of maximum length.

For example, in the following network, we can form a collider of length $4$ $4$ by building a tunnel between junctions $1$ $1$ and $5$ $5$ , or between $2$ $2$ and $5$ $5$ :

$\text{[math]}$

Input Specification

The first line of each test case will contain $N$ $N$ ( $3 \le N \le 400\,000$ $3 \leq N \leq 400 000$ ), the number of junctions. The next $N - 1$ $N - 1$ lines will each contain two space-separated integers $i$ $i$ and $j$ $j$ , indicating that there is a tunnel between junctions $i$ $i$ and $j$ $j$ ( $1 \le i,j \le N$ $1 \leq i, j \leq N$ ).

Output Specification

The output should consist of a single line with two space-separated integers: the length of the longest possible collider, and the number of ways to achieve that length. Note that you may need a 64-bit integer to store the answer (long long in C/C++, LongInt in Pascal).

For test cases worth $40\%$ $40 %$ of the points, you may assume that $N \le 5000$ $N \leq 5000$ .

Sample Input

Copy

Output for Sample Input

Copy

4 2

Comments

9

Dan13llljws commented on March 12, 2020, 8:28 p.m.

I think the problem should also be tagged DP since its one of the ways of doing it

4

septence123 commented on March 18, 2017, 11:00 p.m.

I was wondering, if I am stuck on a CCO problem where can I find solutions or get hints? Does anyone know if there are any editorials for the CCO? Really want to learn.

1

imaxblue commented on March 19, 2017, 1:20 p.m. ← edited →

you can always ask for help on the discord