黑与白 - 题目

#5736. 黑与白

统计

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

给定一个 $n \times n$ 的网格，其中每个方格都被涂成黑色或白色。如果一个网格满足以下所有条件，则称其为正确的：

每一行中黑色方格的数量与白色方格的数量相等。
每一列中黑色方格的数量与白色方格的数量相等。
没有任何行或列包含 3 个或更多连续的相同颜色的方格。

给定一个网格，判断它是否正确。

输入格式

第一行包含一个整数 $n$ ($2 \le n \le 24$; $n$ 为偶数)。接下来的 $n$ 行，每行包含一个长度为 $n$ 的字符串，仅由字符 'B' 和 'W' 组成，表示网格方格的颜色。

输出格式

如果网格是正确的，输出数字 1；否则，输出数字 0。

样例

输入 1

4
WBBW
WBWB
BWWB
BWBW

输出 1

输入 2

4
BWWB
BWBB
WBBW
WBWW

输出 2

输入 3

6
BWBWWB
WBWBWB
WBBWBW
BBWBWW
BWWBBW
WWBWBB

输出 3

输入 4

6
WWBBWB
BBWWBW
WBWBWB
BWBWBW
BWBBWW
WBWWBB

输出 4

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0