Educational Codeforces Round 26 B

Flag of Berland

题意：

思路：模拟

AC代码：

#include "iostream"
#include "iomanip"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#pragma comment(linker, "/STACK:102400000,102400000")
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define mem(a,x) memset(a,x,sizeof(a))
#define step(x) fixed<< setprecision(x)<<
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define ll long long
#define endl ("
")
#define ft first
#define sd second
#define lrt (rt<<1)
#define rrt (rt<<1|1)
using namespace std;
const long long INF = 1e18+1LL;
const int inf = 1e9+1e8;
const int N=1e5+100;
const ll mod=1e9+7;

char s[105][105];
int n,m,r,b,g,mc[150];
int main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin>>n>>m;
    for(int i=1; i<=n; ++i){
        cin>>s[i]+1;
    }
    int f=0,flag=0,mk=0;
    for(int i=2; i<=m; ++i){
        if(s[1][i]!=s[1][i-1]){
            f=1;
            break;
        }
    }
    s[0][1]='O',s[1][0]='O';
    if(!f){
        for(int i=1; i<=n; ++i){
            mc[s[i][1]]++;
            if(s[i][1]!=s[i-1][1]) mk++;
            for(int j=2; j<=m; ++j){
                if(s[i][j]!=s[i][j-1]){
                    cout<<"NO";
                    return 0;
                }
            }
        }
    }
    else{
        for(int j=1; j<=m; ++j){
            mc[s[1][j]]++;
            if(s[1][j]!=s[1][j-1]) mk++;
            for(int i=2; i<=n; ++i){
                if(s[i][j]!=s[i-1][j]){
                    cout<<"NO";
                    return 0;
                }
            }
        }
    }
    if(mk!=3 || mc['R']!=mc['B'] || mc['B']!=mc['G']){
        cout<<"NO";
        return 0;
    } //cout<<mk<<" "<<mc['R']<<" "<<mc['B']<<" "<<mc['G']<<endl;
    cout<<"YES";
    return 0;
}