GCPC11J - Time to live

As you might know, most computer networks are organized in a tree-like fashion, i.e. each computer is reachable by each other computer but only over one, unique path.

The so-called Time to live (TTL) specifies after how many hops a network packet is dropped if it has not reached its destination yet. The purpose of the TTL is to avoid situations in which a packet circulates through the network caused by errors in the routing tables.

The placement of a router that connects the network to another network is optimal when the maximal needed TTL for packets that are sent from this router to any other computer within the same network is minimal. Given a network as specified above, you should calculate the maximal needed TTL in this network if you can select the computer that should be used as router.


The first line of the input consists of the number of test cases c that follow (1 ≤ c ≤ 100). Each test case starts with a line specifying N, the number of computers in this network (1 < N ≤ 105). Computers are numbered from 0 to N-1. Then follow N-1 lines, each specifying a network connection by two numbers a and b which means that computer a is connected to computer b and vice versa, of course (0 ≤ a,b < N).


For each test case in the input, print one line containing the optimal TTL as specified above.


1 0
3 2
2 1
0 2
2 4
3 1
6 5
3 4
0 3
8 1
1 7
1 6
2 3


hide comments
Andres Mauricio Rondon Patiño: 2015-03-31 20:03:25

I'm getting NZEC (No Zero Exit Code) in python. However I got AC in C++ Can anyone help me?

Dario Sindicic: 2015-03-27 09:45:45

be careful --> 0 ≤ a,b < N

AlphaDecay: 2015-02-04 22:30:20

Amazing !!

Ajey Golsangi: 2011-10-06 09:41:27

Awesome problem. I feel enlightened.

Added by:Adrian Kuegel
Time limit:1.807s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:German Collegiate Programming Contest 2011 (Author: Tobias Werth)