Linije
레이팅 미적용의견: 0
\(2^{nd}\) round, November \(9^{th}\), 2013
Mirko and his faithful friend Slavko got really bored one day. The result of their boredom is the
creation of a new game! In the beginning of the game, they draw N points in a coordinate system. The
players take turns and Mirko plays first. He draws a straight line which is parallel to one of the axes of
the coordinate system and passes through one of the N points. In the following moves, the player
draws a straight line which is parallel to one of the axes of the coordinate system and passes through
one of the N points located on the line drawn in the previous move of the opponent. No single line
must be drawn twice. The loser is the player who cannot play his move. Determine who has the
winning strategy.
In test cases worth 40% of total points, N will not exceed 10.
The first and only line of input contains the positive integer N (\(1 \le N \le 10\,000\)).
Each of the following N lines contains two integers X and Y, the coordinates of the points drawn (1 ≤
X, \(Y \le 500\)).
The first and only line of output must contain the name of the winner, either 'Mirko' or 'Slavko'.
3
1 1
1 2
1 3Mirko4
1 1
1 2
2 1
2 2SlavkoClarification of the first example: If Mirko draws the line y = 1, Slavko has to draw x = 1. Then
Mirko draws the line y = 2, and Slavko's only remaining move is to draw x = 1 again, which isn't
allowed.
평가 및 의견
Linije
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Linije