Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: The Domino Principle
Description There is a configuration of t+1 (if they have not fallen before) if the stone i falls at time t. Write a program to determine which stone should be pushed to fall at the time 0 to achieve complete destruction of the configuration that takes the longest possible time. Input The first line of the input contains the number of stones i≤N). Each of these lines contains first the potency of the set D and then the numbers of stones in the set separated by one or more spaces._{i}Output The first line of the output must contain the time of fall of the last stone in the configuration, and the second line - the number of the stone that should be pushed first. If the maximal time can be achieved starting from several initial stones, output the maximal possible number. If the configuration can’t be destroyed completely, the first and only line of the file must contain the word ‘ Sample Input 3 2 2 3 1 3 0 Sample Output 1 1 Source Northeastern Europe 2002, Western Subregion |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator