农田灌溉（ZOJ2412）

我写的那么完美，为什么不对！！！！！！

#include <stdio.h>
#include <stdlib.h> 
#include <string.h>

int m,n;
char farm[51][51];
int visit[51][51];
int pipe[11][4] = { {1,1,0,0},{1,0,0,1},{0,1,1,0},{0,0,1,1},
                    {1,0,1,0},{0,1,0,1},{1,1,0,1},{1,1,1,0},
				    {0,1,1,1},{1,0,1,1},{1,1,1,1} };
int dir[4][2] = {{-1,0},{0,-1},{1,0},{0,1}};

void dfs (int x,int y,int d){
	int k = farm[x][y] - 'A';
	if(pipe[k][d]) {
		//设置访问标记 
		visit[x][y] = 1;
		for (int p = 0;p < 4;p++) {
			if (pipe[k][p]) {
				int xx = x+dir[p][0];
				int yy = y+dir[p][1];
				if (xx<0 || xx>=m || yy<0 || yy>=n||visit[xx][yy]) 
				    continue;
				dfs(xx,yy,(p+2)%4);
			}
	    }
	}
} 

int main () {
	
	while (1) {
		scanf ("%d %d",&m,&n);
		memset(visit,0,sizeof(visit));
		if (m<0 || n<0)
		    break;
		for (int i = 0;i < m;i++) {
			for (int j = 0;j < n;j++) 
				scanf ("%c",&farm[m][n]);
			getchar();
		}
		int count = 0;
		for (int i = 0;i < m;i++) {
			for (int j = 0;j < n;j++) {
				//未被访问过 
				if (!visit[i][j]) {
					dfs(i,j,0);
					dfs(i,j,1);
					dfs(i,j,2);
				    count++;
				}
			}
		}
		printf ("%d\n",count);
    }
	return 0;
}