Saboya and Alfredo are two very dedicated students who have a special competition between them during contests. They really don't care about being the person who solves the most amount of questions; rather, they prefer to be the one that solves the most amount of problems first. That being said, if during a contest, one of them solves 6 problems and the other solves 8, the former may still be declared the victor if he has more first solves than the other. Note that, if they end up solving the same question at the same time, then neither of them can claim the title of first solve for that one.
They end up participating in $$$t$$$ contests, and since it can be a large amount, they ask for your assistance in discovering who came out victorious in each contest.
The first line contains an integer $$$t$$$ $$$(1 \leq t \leq 10^5)$$$ — the number of contests in which Saboya and Alfredo participate.
The first line of each contest contains an integer $$$n$$$ $$$(1 \leq n \leq 10^6)$$$ — the amount of questions in that specific contest.
The second line of each contest contains $$$n$$$ integers $$$(a_1, a_2, ..., a_n)$$$ $$$(-1 \leq a_i \leq 10^9)$$$ — the time that had elapsed during the contest when Saboya got the question correct. If the value is -1, then he was unable to solve it during the contest.
The third line of each contest contains $$$n$$$ integers $$$(b_1, b_2, ..., b_n)$$$ $$$(-1 \leq b_i \leq 10^9)$$$ — the time that had elapsed during the contest when Alfredo got the question correct. If the value is -1, then he was unable to solve it during the contest.
It is guaranteed that the sum of $$$n$$$ over all contests doesn't exceed $$$10^6$$$.
For each contest, output Saboya if he'd win the competition, Alfredo if he'd win it, otherwise output Tie if there's a tie happening.
134 5 2-1 2 1
Alfredo
24-1 -1 -1 -1-1 -1 -1 -154 9 2 0 15 7 2 3 2
Tie Saboya
| IME++ Starters Try-outs 2024 |
|---|
| Закончено |
