HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Graph problems and UF > problem:


50857 - Nine-Stones Game

Section problems

• 50694 - The Cheapest Flight
• 50841 - My grand-grand-grandfather
• 50697 - Base Stations
• 50695 - Longest link between neurons
• 50414 - Traffic
• 50698 - Ayran Delivery
• 50978 - Albanian Coders
• 50699 - Fighting Vampires
• 50857 - Nine-Stones Game
• 50929 - Present from your uncles
• 51076 - Key person
• 51080 - Deepest Point
• 51079 - Key person - 2
• 50464 - From Tirana to Durres
• 50691 - The traveling salesman prob...
• 50701 - Cell Removal
• 50703 - The Shortest Path

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Question by Ibrahim Mesecan.

Nine-Stones

Nine-stones game is an old game played on a board similar to the one on the right. The purpose of the game is to put 3 same color stones in a row, (on the same continuous line) so that you can remove one piece from your opponent. Number positions and adjacency list is given in the second image. For example in the third image, the green stones are aligned on a straight-line while orange and black pieces are not.

Question:
You are going to be given the coordinates of n-stones for two players. According to the given stone order, find the first color which aligns three stones on a row (on an adjacent straight-line).

Input specification
Firstly, you are going to be given a number (n) the number of pieces to be placed on the board where 0 ≤ n ≤ 16. Then in the following n lines, you are going to be given the coordinates and colors (black or white) of n pieces.

Output specification
Show color of the first group which aligns on a line the first. Show the message "No", if no group aligns the pieces on a line.

Sample Input I
6
4 w
7 b
8 b
5 w
6 w
9 b
Sample Input II
6
7 b
8 b
9 b
2 w
10 w
16 w
Sample Output I
w
Sample Output II
No


Для отправки решений необходимо выполнить вход.

www.contester.ru