Time Limit: 2 Seconds
Memory Limit: 65536 KB
Flip game is played on a rectangular 4x4 field with two-sided pieces placed on
each of its 16 squares. One side of each piece is white and the other one is black
and each piece is lying either it's black or white side up. Each round you flip
3 to 5 pieces, thus changing the color of their upper side from black to white
and vice versa. The pieces to be flipped are chosen every round according to the
- Choose any one of the 16 pieces.
- Flip the chosen piece and also all adjacent pieces to the left, to the right,
to the top, and to the bottom of the chosen piece (if there are any).
Consider the following position as an example:
Here "b" denotes pieces lying their black side up and "w"
denotes pieces lying their white side up. If we choose to flip the 1st piece
from the 3rd row (this choice is shown at the picture), then the field will
The goal of the game is to flip either all pieces white side up or all pieces
black side up. You are to write a program that will search for the minimum number
of rounds needed to achieve this goal.
The input consists of 4 lines with 4 characters "w" or "b"
each that denote game field position.
Write to the output a single integer number - the minimum number of rounds needed
to achieve the goal of the game from the given position. If the goal is initially
achieved, then write 0. If it's impossible to achieve the goal, then write the
word "Impossible" (without quotes).
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed
by N input blocks. Each input block is in the format indicated in the problem
description. There is a blank line between input blocks.
The output format consists of N output blocks. There is a blank line between
Source: Northeastern Europe 2000