hdu Farm Irrigation

#include"iostream"
#include"stdio.h"
#include"algorithm"
#include"cmath"
#include"queue"
#include"stack"
#include"vector"
#include"string"
#include"string.h"
using namespace std;
const int mx=1005;
int A[3][3]={{0,1,0},{1,1,0},{0,0,0}};
int B[3][3]={{0,1,0},{0,1,1},{0,0,0}};
int C[3][3]={{0,0,0},{1,1,0},{0,1,0}};
int D[3][3]={{0,0,0},{0,1,1},{0,1,0}};
int E[3][3]={{0,1,0},{0,1,0},{0,1,0}};
int F[3][3]={{0,0,0},{1,1,1},{0,0,0}};
int G[3][3]={{0,1,0},{1,1,1},{0,0,0}};
int H[3][3]={{0,1,0},{1,1,0},{0,1,0}};
int I[3][3]={{0,0,0},{1,1,1},{0,1,0}};
int J[3][3]={{0,1,0},{0,1,1},{0,1,0}};
int K[3][3]={{0,1,0},{1,1,1},{0,1,0}};
int dir[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
int maze[mx][mx];
bool visited[mx][mx];
int m,n,wellspring;
bool judge(int x,int y)
{
    if(x>=0&&x<3*m&&y>=0&&y<3*n&&maze[x][y]==1&&!visited[x][y])
        return true;
    return false;
}
void dfs(int x,int y)
{
    int dx,dy;
    for(int i=0;i<4;i++)
    {
        dx=x+dir[i][0];
        dy=y+dir[i][1];
        if(judge(dx,dy))
        {
            visited[dx][dy]=true;
             dfs(dx,dy);
        }
    }
}
void creat_maze(int a[][3],int i,int j)
{
    int p,q;
    for(p=i*3;p<i*3+3;p++)
    {
        for(q=j*3;q<j*3+3;q++)
        {
            maze[p][q]=a[p-i*3][q-j*3];
        }
    }
}
void wellspring_count()
{
    int i,j;
    for(i=0;i<3*m;i++)
    {
        for(j=0;j<3*n;j++)
        {
            if(maze[i][j]==1&&!visited[i][j])
            {
                wellspring++;
                visited[i][j]=true;
                dfs(i,j);
            }
        }
    }
    printf("%d\n",wellspring);
}
void input()
{
    int i,j;
    while(scanf("%d%d",&m,&n),m!=-1||n!=-1)
    {
        memset(visited,false,sizeof(visited));
        wellspring=0;
        char pipe;
        for(i=0;i<m;i++)
       {
           getchar();
        for(j=0;j<n;j++)
        {
            scanf("%c",&pipe);
            switch(pipe)
            {
                case ‘A‘: creat_maze(A,i,j);break;
                case ‘B‘: creat_maze(B,i,j);break;
                case ‘C‘: creat_maze(C,i,j);break;
                case ‘D‘: creat_maze(D,i,j);break;
                case ‘E‘: creat_maze(E,i,j);break;
                case ‘F‘: creat_maze(F,i,j);break;
                case ‘G‘: creat_maze(G,i,j);break;
                case ‘H‘: creat_maze(H,i,j);break;
                case ‘I‘: creat_maze(I,i,j);break;
                case ‘J‘: creat_maze(J,i,j);break;
                case ‘K‘: creat_maze(K,i,j);break;
            }
        }
       }
        wellspring_count();
    }
}

int main()
{
 //   freopen("E:\\in.txt","r",stdin);
    input();
    return 0;
}