题目:
The flag of Berland is such rectangular field n × m that satisfies following conditions:
- Flag consists of three colors which correspond to letters 'R', 'G' and 'B'.
- Flag consists of three equal in width and height stripes, parralel to each other and to sides of the flag. Each stripe has exactly one color.
- Each color should be used in exactly one stripe.
You are given a field n × m, consisting of characters 'R', 'G' and 'B'. Output "YES" (without quotes) if this field corresponds to correct flag of Berland. Otherwise, print "NO" (without quotes).
The first line contains two integer numbers n and m (1 ≤ n, m ≤ 100) — the sizes of the field.
Each of the following n lines consisting of m characters 'R', 'G' and 'B' — the description of the field.
Print "YES" (without quotes) if the given field corresponds to correct flag of Berland . Otherwise, print "NO" (without quotes).
6 5
RRRRR
RRRRR
BBBBB
BBBBB
GGGGG
GGGGG
YES
4 3
BRG
BRG
BRG
BRG
YES
6 7
RRRGGGG
RRRGGGG
RRRGGGG
RRRBBBB
RRRBBBB
RRRBBBB
NO
4 4
RRRR
RRRR
BBBB
GGGG
NO
The field in the third example doesn't have three parralel stripes.
Rows of the field in the fourth example are parralel to each other and to borders. But they have different heights — 2, 1 and 1.
思路:要睡觉前才想起有比赛没打,最后半小时才开始慌张的打开电脑开始做题。题意理解了却没想出好方法,好菜啊~午觉醒来后感觉有了思路,直接三等分n或m。然而还是WA很多次,醉了......
CODE:
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n, m, r, g, b, i, j;
char s[105][105];
while (~scanf("%d%d", &n, &m))
{
for (i = 0; i < n; i++)
{
scanf("%s", s[i]);
}
int flag = 0;
if (n % 3 == 0)
{
char ch1 = s[0][0];
char ch2 = s[n / 3 ][0];
char ch3 = s[2 * n / 3 ][0];
if (ch1 != ch2 && ch2 != ch3 && ch1 != ch3)
{
r = g = b = 1;
for (i = 0; i < n / 3; i++)
{
for (j = 0; j < m; j++)
{
if (s[i][j] != ch1)
{
r = 0;
break;
}
}
}
for (i = n / 3; i < 2 * n / 3; i++)
{
for (j = 0; j < m; j++)
{
if (s[i][j] != ch2)
{
g = 0;
break;
}
}
}
for (i = 2 * n / 3; i < n; i++)
{
for (j = 0; j < m; j++)
{
if (s[i][j] != ch3)
{
b = 0;
break;
}
}
}
if (r && g && b)
{
flag = 1;
}
}
}
if (!flag && (m % 3 == 0))
{
char ch1 = s[0][0];
char ch2 = s[0][m / 3];
char ch3 = s[0][2 * m / 3];
if (ch1 != ch2 && ch2 != ch3 && ch1 != ch3)
{
r = g = b = 1;
for (j = 0; j < m / 3; j++)
{
for (i = 0; i < n; i++)
{
if (s[i][j] != ch1)
{
r = 0;
break;
}
}
}
for (j = m / 3; j < 2 * m / 3; j++)
{
for (i = 0; i < n; i++)
{
if (s[i][j] != ch2)
{
g = 0;
break;
}
}
}
for (j = 2 * m / 3; j < m ; j++)
{
for (i = 0; i < n; i++)
{
if (s[i][j] != ch3)
{
b = 0;
break;
}
}
}
if (r && g && b)
{
flag = 1;
}
}
}
if (flag)
{
puts("YES");
}
else
{
puts("NO");
}
}
return 0;
}