标签:
2 4 RR.B .RG. .BRR B..R 4 RRBB RGGB BGGR BBRR
3 6
暴力把2个方向判一遍
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (50+10)
typedef long long ll;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int n,m;
char s[MAXN][MAXN];
int main()
{
// freopen("D.in","r",stdin);
int T;cin>>T;
while(T--)
{
int n;
scanf("%d\n",&n);
For(i,n) scanf("%s",s[i]+1);
m=strlen(s[1]+1);
int ans=0;
Fork(k,2,n+m)
{
bool flag=0;
For(i,n)
{
int j=k-i;
if (j<1||j>m) continue;
if (s[i][j]=='B'||s[i][j]=='G') {
if (!flag) flag=1,ans++;
}
else flag=0;
}
}
For(i,n) For(j,m/2) swap(s[i][j],s[i][m-j+1]);
Fork(k,2,n+m)
{
bool flag=0;
For(i,n)
{
int j=k-i;
if (j<1||j>m) continue;
if (s[i][j]=='R'||s[i][j]=='G') {
if (!flag) flag=1,ans++;
}
else flag=0;
}
}
cout<<ans<<endl;
}
return 0;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。
标签:
原文地址:http://blog.csdn.net/nike0good/article/details/47756355