E - GirlCat

水题，可以暴力for加if

#include<iostream>
#include<stdio.h>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<functional>
#include<set>
#include<map>
#include<cstdlib>
#include<vector>
#include<cmath>
#include <algorithm>
#pragma warning(disable:4996)
using namespace std;
int T, n, i, j,m,num,cnt;
char s[1010][1010], kind[2][5] = { "girl","cat" };
bool vis[1010][1010];
bool check(int x, int y)
{
	return x >= 0 && x<n&&y >= 0 && y<m;
}
void dfs(int x,int y,int p,int q)
{
	if (!check(x, y) || s[x][y] != kind[q][p])
		return;
	vis[x][y] = true;
	if (q&&p == 2)
	{
		cnt++;
		return;
	}
	if (!q&&p == 3)
	{
		num++;
		return;
	}
	dfs(x + 1, y, p + 1, q);
	dfs(x, y + 1, p + 1, q);
	dfs(x - 1, y, p + 1, q);
	dfs(x, y - 1, p + 1, q);
}
int main()
{
	scanf("%d", &T);
	while (T--)
	{
		num = 0;
		cnt = 0;
		memset(vis, false, sizeof(vis));
		scanf("%d %d", &n,&m);
		for (i = 0; i < n; i++)
			scanf("%s", s[i]);	
		for (i = 0; i < n; i++)
		{		
			for (j = 0; j < m; j++)
			{
				if (!vis[i][j])
				{
					if (s[i][j] == 'g')
						dfs(i, j, 0, 0);
					else if (s[i][j] == 'c')
						dfs(i, j, 0, 1);
				}
			}
		}
		printf("%d %d\n", num, cnt);
	}
//	system("pause");
	return 0;
}