Painter
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 886 Accepted Submission(s): 404
Each test case begins with an integer number n describe the number of rows of the drawing board.
Then n lines of string consist of ‘R’ ‘B’ ‘G’ and ‘.’ of the same length. ‘.’ means the grid has not been drawn.
1<=n<=50
The number of column of the rectangle is also less than 50.
Output
Output an integer as described in the problem description.
2 4 RR.B .RG. .BRR B..R 4 RRBB RGGB BGGR BBRR
3 6
/* ***********************************************
Author :
Created Time :2015/7/30 19:45:12
File Name :1.cpp
************************************************ */
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <iomanip>
#include <list>
#include <deque>
#include <stack>
#define ull unsigned long long
#define ll long long
#define mod 90001
#define INF 1<<30
#define maxn 10000+10
#define cle(a) memset(a,0,sizeof(a))
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){
return a>b;
}
char mp[55][55];
int n,m;
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
#endif
//freopen("out.txt","w",stdout);
int t;
cin>>t;
while(t--){
cle(mp);
cin>>n;
getchar();
gets(mp[1]);
m=strlen(mp[1]);
for(int i=2;i<=n;i++){
gets(mp[i]);
}
int ans=0;
for(int i=1;i<=n;i++)
for(int j=0;j<m;j++){
if((mp[i][j]=='R'||mp[i][j]=='G')&&!(mp[i+1][j+1]=='R'||mp[i+1][j+1]=='G'))
ans++;
if((mp[i][j]=='B'||mp[i][j]=='G')&&!(mp[i-1][j+1]=='B'||mp[i-1][j+1]=='G'))
ans++;
}
cout<<ans<<endl;
}
return 0;
}