CF1491I.Ruler Of The Zoo

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

After realizing that Zookeeper is just a duck, the animals have overthrown Zookeeper. They now have to decide a new ruler among themselves through a fighting tournament of the following format:

Initially, animal 00 is king, while everyone else queues up with animal 11 at the front of the queue and animal n1n-1 at the back. The animal at the front of the queue will challenge the king to a fight, and the animal with greater strength will win the fight. The winner will become king, while the loser joins the back of the queue.

An animal who wins 33 times consecutively will be crowned ruler for the whole zoo. The strength of each animal depends on how many consecutive fights he won. Animal ii has strength AiA_i with 00 consecutive win, BiB_i with 11 consecutive win, and CiC_i with 22 consecutive wins. Initially, everyone has 00 consecutive win.

For all animals, Ai>BiA_i > B_i and Ci>BiC_i > B_i . Also, the values of AiA_i , BiB_i , CiC_i are distinct (all 3n3n values are pairwise different).

In other words, an animal who is not a king has strength AiA_i . A king usually has a strength of BiB_i or CiC_i . The exception is on the first turn, the first king (animal 00 ) has strength AiA_i .

Who is the new ruler, and after how many fights? Or will it end up that animals fight forever with no one ending up as ruler?

输入格式

The first line contains one integer nn ( 4n60004 \leq n \leq 6000 ) — number of the animals.

ii -th of the next nn lines contains 33 integers AiA_i , BiB_i and CiC_i ( 0Ai,Bi,Ci1090 \leq A_i, B_i, C_i \leq 10^9 ).

It is guaranteed that Ai>BiA_i > B_i and Ci>BiC_i > B_i , and that all values of AiA_i , BiB_i and CiC_i are distinct.

输出格式

Output two integers in a single line. The first is the index of the animal that will become ruler, and the second is the number of fights passed until some animal becomes the ruler.

If the animals will fight for infinitely long, output -1 -1 instead.

输入输出样例

  • 输入#1

    4
    5 1 2
    10 8 11
    9 0 3
    7 4 6

    输出#1

    -1 -1
  • 输入#2

    5
    11 7 12
    8 6 14
    2 1 10
    13 0 9
    5 3 4

    输出#2

    1 7

说明/提示

The following describes the sequence of events for the second sample. Note that in fight 11 , the king (animal 00 ) has strength A0A_0 . The tournament ends at fight 77 as animal 11 wins fight 55 , 66 and 77 .

首页