HDU-1198 Farm Irrigation

HDU-1198 Farm Irrigation

1.题面

传送们

2.解题思路

题意要求你数出有多少个连通块，题目并不难，但是很繁琐，代码量比较大，容易出错。使用并查集或是使用dfs或是使用bfs，细心一点就好。

3.解题代码

/*****************************************************************

  > File Name: tmp.cpp
  > Author: Uncle_Sugar
  > Mail: uncle_sugar@qq.com
  > Created Time: 2016年02月19日 星期五 12时56分32秒
 ****************************************************************/
# include <cstdio>
# include <cstring>
# include <cmath>
# include <cstdlib>
# include <iostream>
# include <iomanip>
# include <set>
# include <map>
# include <vector>
# include <stack>
# include <queue>
using namespace std;

const int debug = 0;
const int size  = 50 + 10;
typedef long long ll;

struct Land{
	int pipe[4];
	Land(){}
	Land(int a,int b,int c,int d){
		pipe[0] = a;
		pipe[1] = b;
		pipe[2] = c;
		pipe[3] = d;
	}
}land[11];


bool match(const Land& l1,int dri,const Land& l2){
	return l1.pipe[dri]==1&&l1.pipe[dri]==l2.pipe[(dri+2)%4];
};

int m,n;
int dx[4] = {-1,0,1,0};
int dy[4] = {0,1,0,-1};


bool inrange(int x,int y){
	return x<m&&x>=0&&y<n&&y>=0;
}
int g[size][size];
int vis[size][size];

void dfs(int x,int y){
	vis[x][y] = 1;
	for (int i=0;i<4;i++){
		int tx = x + dx[i];
		int ty = y + dy[i];
		if (inrange(tx,ty)&&vis[tx][ty]==0
				&&match(land[g[x][y]],i,land[g[tx][ty]])){
			dfs(tx,ty);
		}
	}
}
int main()
{
	std::ios::sync_with_stdio(false);cin.tie(0);
	int i,j,k;

	land[0] = Land(1,0,0,1);
	land[1] = Land(1,1,0,0);
	land[2] = Land(0,0,1,1);
	land[3] = Land(0,1,1,0);
	land[4] = Land(1,0,1,0);
	land[5] = Land(0,1,0,1);
	land[6] = Land(1,1,0,1);
	land[7] = Land(1,0,1,1);
	land[8] = Land(0,1,1,1);
	land[9] = Land(1,1,1,0);
	land[10] = Land(1,1,1,1);
	while (cin >> m >> n){
		if (n<0||m<0)	break;
		memset(vis,0,sizeof(vis));
		int sum = n*m;
		char str[100];
		for (i=0;i<m;i++){
			cin >> str;
			for (j=0;j<n;j++){
				g[i][j] = str[j] - 'A';
			}
		}
		int ans = 0;
		for (i=0;i<m;i++){
			for (j=0;j<n;j++){
				if (vis[i][j]==0){
					dfs(i,j);
					ans++;
				}
			}
		}
		cout << ans << '\n';
	}
	return 0;
}