Challenge 2 - The Lucky One
We really enjoy ping-pong in our office. We enjoy tournaments too. Everyone thinks she's the best, but that's far from the truth. Everyone has an inner skill si. If players i and j play a game of ping-pong, player i wins if si is greater than sj, but otherwise they lose. No two players have the same skill level.
We have a ping-pong tournament coming up. Help me predict the winner! I have a list of matches and their outcome. Can you tell me who the strongest player in our office is?
A unique solution is guaranteed to exist.
The first line has an integer C, which is the number of cases for the problem.
Each case starts with a line with one integer, N, which is the number of matches. The following N lines contain three integers: A, the number of the first player, B, the number of the second player, and R, which is 1 if A won, and 0 otherwise. Players are numbered from 1 to P, with P being the total number of players.
For each case, output a line starting with "Case #x: " followed by the number of the strongest player. Every line should end with a new line character.
- 1 ≤ C ≤ 10
- 1 ≤ N ≤ 1000000
1 3 3 2 1 1 3 0 3 2 1
Case #1: 3
Test your code
You can test your program against both the input provided in the test phase and the input provided in the submit phase. A nice output will tell you if your program got the right solution or not. You can try as many times as you want. Be careful with extra whitespace. The output should be exactly as described.
Test your program against the input provided in the test phase
Test your program against the input provided in the submit phase
During the submit phase, in some problems, we might give your program harder inputs. As with the test token, a nice output will tell you if your program got the right solution or not. You can try as many times as you need.
In the actual contest you have to solve the test phase before you can submit your code. You must provide the source code used to solve the challenge and you can only make one submission. After your solution is submitted, you won't be able to modify it to fix issues or make it faster.
If you have any doubts, please see the info section.
min: 0:01:45 h
10th percentile: 0:17:33 h
90th percentile: 22:00:10 h
max: 108:13:14 h
|Test phase time:||
10th percentile: 0:14:23 h
90th percentile: 18:32:56 h
|Submit phase time:||
10th percentile: 0:00:55 h
90th percentile: 1:38:55 h
|# of completions:||512|