J.This Ain‘t Your Grandpa‘s Checkerboard (简单遍历)(2021年度训练联盟热身训练赛第一场)

传送门

题目要求：

①每一行的黑色方块数量相等  ②每一列的黑色与白色的方块数相等   ③ 每一行或列没有连续3个会以上的相同色块。

思路：直接遍历统计一遍即可。

代码实现：

#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int  inf = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll   mod = 1e9+7;
const int  N = 2e5 + 5;

inline void read(int &x){
    char t=getchar();
    while(!isdigit(t)) t=getchar();
    for(x=t^48,t=getchar();isdigit(t);t=getchar()) x=x*10+(t^48);
}

int n, flag=1;
char s[50][50];

signed main()
{
    IOS;

    cin >> n;
    int cowb = 0;
    for(int i = 1; i <= n; i ++){   //每一行
        cin >> s[i]+1;
        int tmp = 0;
        for(int j = 1; j <= n; j ++){
            if(s[i][j]=='B'){
                if(i==1) cowb ++;
                else tmp ++;
                if(s[i][j-1]=='B'&&s[i][j+1]=='B') flag = 0;
            }
            else{
                if(s[i][j-1]=='W'&&s[i][j+1]=='W') flag = 0;
            }
        }
        if(i!=1&&tmp!=cowb) flag = 0;
    }
    for(int j = 1; j <= n; j ++){   //每一列
        int cntb = 0, cntw = 0;
        for(int i = 1; i <= n; i ++){
            if(s[i][j]=='B'){
                cntb ++;
                if(s[i-1][j]=='B'&&s[i+1][j]=='B') flag = 0;
            }
            else{
                cntw ++;
                if(s[i-1][j]=='W'&&s[i+1][j]=='W') flag = 0;
            }
        }
        if(cntb!=cntw) flag = 0;
    }
    cout << flag << endl;

    return 0;
}