|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|2 초||512 MB||0||0||0||0.000%|
Piggy decided to organize a biathlon race, where the competitors would compete in two disciplines. She invited N competitors, who have the following characteristics:
As an organizer, Piggy can choose whatever distances she likes (non-negative real numbers S1 and S2) for each of the two disciplines. Now she is wondering which competitors are potential winners, that’s to say, whether there exist S1 and S2 to ensure them victory.
Write a program biathlon to determine which competitors can win.
On the first line of the standard input, N is given. On the next N lines are given two positive integers V1 and V2, separated by a space: the velocities of the i-th competitor (for i=0, 1, …, N-1).
On one line of the standard output, print the indexes of the competitors who can win. The indexes should be in increasing order, separated by spaces. Indexing starts from 0. This line should contain the number -1, when there is no competitor who can win.
4 1 4 2 2 4 1 3 3
0 2 3
3 3 3 3 3 2 2
All competitors, who can win, have the indexes: 0, 2 and 3. The one with index 0 wins for distances, for example, S1=0 and S2=10; competitor with index 2 wins for distances S1=10 and S2=0; the one with index 3 wins for some distances S1=10 and S2=10. Competitor with index 1 cannot win: he is always being defeated by competitor with index 3.