
ZOJ Problem Set  2913
You travel a lot by bus and the costs of all the seperate tickets are starting to add up. Therefore you want to see if it might be advantageous for you to buy a bus pass. The way the bus system works in your country (and also in the Netherlands) is as follows: when you buy a bus pass, you have to indicate a center zone and a star value. You are allowed to travel freely in any zone which has a distance to your center zone which is less than your star value. For example, if you have a star value of one, you can only travel in your center zone. If you have a star value of two, you can also travel in all adjacent zones, et cetera. You have a list of all bus trips you frequently make, and would like to determine the minimum star value you need to make all these trips using your buss pass. But this is not always an easy task. For example look at the following figure:
Input On the first line an integert(1 <=t<= 100): the number of test cases. Then for each test case: One line with two integersnz(2 <=nz<= 9 999) andnr(1 <=nr<= 10): the number of zones and the number of bus trips, respectively. nz lines starting with two integers id_{i} (1 <= id_{i} <= 9 999) and mz_{i} (1 <= mz_{i} <= 10), a number identifying the ith zone and the number of zones adjacent to it, followed by mz_{i} integers: the numbers of the adjacent zones. nr lines starting with one integer mr_{i} (1 <= mr_{i} <= 20), indicating the number of zones the ith bus trip visits, followed by mr_{i} integers: the numbers of the zones through which the bus passes in the order in which they are visited. All zones are connected, either directly or via other zones. Output For each test case: One line with two integers, the minimum star value and the id of a center zone which achieves this minimum star value. If there are multiple possibilities, choose the zone with the lowest number. Sample Input
1 Sample Output
4 7400 Source: The 2007 Benelux Algorithm Programming Contest 