Codeforces Global Round 13
I
Ruler Of The Zoo
Codeforces
3500
原题
← H→
翻译中…

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 $0$ is king, while everyone else queues up with animal $1$ at the front of the queue and animal $n-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 $3$ times consecutively will be crowned ruler for the whole zoo. The strength of each animal depends on how many consecutive fights he won. Animal $i$ has strength $A_i$ with $0$ consecutive win, $B_i$ with $1$ consecutive win, and $C_i$ with $2$ consecutive wins. Initially, everyone has $0$ consecutive win.

翻译中…

For all animals, $A_i \gt B_i$ and $C_i \gt B_i$. Also, the values of $A_i$, $B_i$, $C_i$ are distinct (all $3n$ values are pairwise different).

翻译中…

In other words, an animal who is not a king has strength $A_i$. A king usually has a strength of $B_i$ or $C_i$. The exception is on the first turn, the first king (animal $0$) has strength $A_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?

翻译中…

Input

翻译中…

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

翻译中…

$i$-th of the next $n$ lines contains $3$ integers $A_i$, $B_i$ and $C_i$ ($0 \leq A_i, B_i, C_i \leq 10^9$).

翻译中…

It is guaranteed that $A_i \gt B_i$ and $C_i \gt B_i$, and that all values of $A_i$, $B_i$ and $C_i$ are distinct.

翻译中…

Output

翻译中…

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.

翻译中…

Note

翻译中…

The following describes the sequence of events for the second sample. Note that in fight $1$, the king (animal $0$) has strength $A_0$. The tournament ends at fight $7$ as animal $1$ wins fight $5$, $6$ and $7$. image

翻译中…

样例

Input #1
4
5 1 2
10 8 11
9 0 3
7 4 6
Output #1
-1 -1
InputCopy OutputCopy
Input #2
5
11 7 12
8 6 14
2 1 10
13 0 9
5 3 4
Output #2
1 7
InputCopy OutputCopy
题目信息
题号
1491I
时间限制
3 s
内存限制
256 MB
标签
暴力
数据结构

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。