Page not loading? Try clicking here.
Placeholder

#1733

Omok 1s 32MB

Problems

Omok is a game played on a 19×19 board with black and white stones placed alternately.

  • The horizontal lines are numbered 1 through 19 from top to bottom.

  • The vertical lines are numbered 1 through 19 from left to right.

A player wins if exactly five stones of the same color are placed consecutively in a row, column, or diagonal.

Note: More than five consecutive stones (six or more) does not count as a win.

Consecutive means in horizontal, vertical, or diagonal directions.


Input

19 lines, each with 19 integers separated by spaces:

  • 0 represents an empty space.

  • 1 represents a black stone.

  • 2 represents a white stone.

Constraints:

  • Only one player can win at a time.

  • There are no cases where a player has multiple winning lines simultaneously.


Output

On the first line:

  • Print 1 if black wins.

  • Print 2 if white wins.

  • Print 0 if there is no winner yet.

If there is a winner, on the second line, print the coordinates of the first stone of the winning sequence:

  • If horizontal, print the leftmost stone.

  • If vertical, print the topmost stone.

  • Format: <row number> <column number> (both 1-based).


Example

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 1 2 0 0 2 2 2 1 0 0 0 0 0 0 0 0 0 0
0 0 1 2 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0
0 0 0 1 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 1 2 2 0 0 0 0 0 0 0 0 0 0 0 0
0 0 1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 2 1 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1

3 2


Source

KOI 전국 2003 초1

You must sign in to write code.