2016女生赛 1005 GirlCat【DFS】

GirlCat

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 699    Accepted Submission(s): 468

Problem Description

As a cute girl, Kotori likes playing ``Hide and Seek'' with cats particularly.
Under the influence of Kotori, many girls and cats are playing ``Hide and Seek'' together.
Koroti shots a photo. The size of this photo is  n×m , each pixel of the photo is a character of the lowercase(from `a' to `z').
Kotori wants to know how many girls and how many cats are there in the photo.

We define a girl as -- we choose a point as the start, passing by 4 different connected points continuously, and the four characters are exactly ``girl'' in the order.
We define two girls are different if there is at least a point of the two girls are different.
We define a cat as -- we choose a point as the start, passing by 3 different connected points continuously, and the three characters are exactly ``cat'' in the order.
We define two cats are different if there is at least a point of the two cats are different.

Two points are regarded to be connected if and only if they share a common edge.

 

Input

The first line is an integer  T  which represents the case number.

As for each case, the first line are two integers  n  and  m , which are the height and the width of the photo.
Then there are  n  lines followed, and there are  m  characters of each line, which are the the details of the photo.

It is guaranteed that:
T  is about 50.
1≤n≤1000 .
1≤m≤1000 .
∑(n×m)≤2×106 .

 

Output

As for each case, you need to output a single line.
There should be 2 integers in the line with a blank between them representing the number of girls and cats respectively.

Please make sure that there is no extra blank.

 

Sample Input

  
  

   
   3
1 4
girl
2 3
oto
cat
3 4
girl
hrlt
hlca
  
  

 

Sample Output

  
  

   
   1 0
0 2
4 1
  
  

 

Source

"巴卡斯杯" 中国大学生程序设计竞赛 - 女生专场

 

Recommend

liuyiding

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<map>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
using namespace std;
#define ll long long
#define ms(a,b) memset(a,b,sizeof(a))
const int M=1e4+10;
int i,j,k,n,m;
int q;
char mp[M][M];
char g[5]={'g','i','r','l'};
char c[5]={'c','a','t'};
int sum1,sum2;
int dir[4][2]={-1,0,1,0,0,-1,0,1};

void dfs1(int x,int y,int st)
{
    if(st>=3)return ;
    if(st==2){sum1++;return;}
    for(int i=0;i<4;i++){
        int xx=x+dir[i][0];
        int yy=y+dir[i][1];
        if(mp[xx][yy]==c[st+1]&&xx>=0&&yy>=0&&xx<n&&yy<m)
            dfs1(xx,yy,st+1);
    }
    return ;
}
void dfs2(int x,int y,int st)
{
    if(st>=4)return ;
    if(st==3){sum2++;return;}
    for(int i=0;i<4;i++){
        int xx=x+dir[i][0];
        int yy=y+dir[i][1];
        if(mp[xx][yy]==g[st+1]&&xx>=0&&yy>=0&&xx<n&&yy<m)
            dfs2(xx,yy,st+1);
    }
    return ;
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--){
      sum1=0,sum2=0;
      scanf("%d%d",&n,&m);
      for(int i=0;i<n;i++)scanf("%s",mp[i]);
      for(int i=0;i<n;i++)
      for(int j=0;j<m;j++){
        if(mp[i][j]=='c')dfs1(i,j,0);
        if(mp[i][j]=='g')dfs2(i,j,0);
      }
      printf("%d %d\n",sum2,sum1);
    }
    return 0;
}