http://acm.hdu.edu.cn/showproblem.php?pid=1198
Farm Irrigation
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4906 Accepted Submission(s): 2110
Problem Description
Benny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes are placed in these squares. Different square has a different type of pipe. There are 11 types of pipes, which is marked from A to K, as Figure 1 shows.
Figure 1
Benny has a map of his farm, which is an array of marks denoting the distribution of water pipes over the whole farm. For example, if he has a map
ADC
FJK
IHE
then the water pipes are distributed like
Figure 2
Several wellsprings are found in the center of some squares, so water can flow along the pipes from one square to another. If water flow crosses one square, the whole farm land in this square is irrigated and will have a good harvest in autumn.
Now Benny wants to know at least how many wellsprings should be found to have the whole farm land irrigated. Can you help him?
Note: In the above example, at least 3 wellsprings are needed, as those red points in Figure 2 show.
![](https://i-blog.csdnimg.cn/blog_migrate/98438320b6a336844ea7a50507e0c94c.gif)
Benny has a map of his farm, which is an array of marks denoting the distribution of water pipes over the whole farm. For example, if he has a map
ADC
FJK
IHE
then the water pipes are distributed like
![](https://i-blog.csdnimg.cn/blog_migrate/c0c0d1bb80698cbbb549ba460e1ce196.gif)
Several wellsprings are found in the center of some squares, so water can flow along the pipes from one square to another. If water flow crosses one square, the whole farm land in this square is irrigated and will have a good harvest in autumn.
Now Benny wants to know at least how many wellsprings should be found to have the whole farm land irrigated. Can you help him?
Note: In the above example, at least 3 wellsprings are needed, as those red points in Figure 2 show.
Input
There are several test cases! In each test case, the first line contains 2 integers M and N, then M lines follow. In each of these lines, there are N characters, in the range of 'A' to 'K', denoting the type of water pipe over the corresponding square. A negative M or N denotes the end of input, else you can assume 1 <= M, N <= 50.
Output
For each test case, output in one line the least number of wellsprings needed.
Sample Input
2 2 DK HF 3 3 ADC FJK IHE -1 -1
Sample Output
2 3
Author
ZHENG, Lu
Source
题意:有11种管道,给出铺设方案,求连通分量的个数
并查集,把能连通的合并,输出剩余集合的个数
#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<ctime>
#include<cctype>
#include<cmath>
#include<string>
#include<cstring>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#define sqr(x) (x)*(x)
#define LL long long
#define INF 0x3f3f3f3f
#define PI 3.14159265358979
#define eps 1e-10
#define mm
using namespace std;
int ans,n,m;
int pre[3333];
/*t数组保存管道类型*/
int t[12][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,
0,0,0,0 };
char ma[55][55];
void init()
{
for (int i=0;i<3333;i++)
pre[i]=i;
ans=n*m;
}
int root(int x)
{
if (x==pre[x])
return x;
return pre[x]=root(pre[x]);
}
void intree(int x,int y)
{
int rx=root(x);
int ry=root(y);
if (rx==ry)
return ;
pre[rx]=ry;
ans--;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("t","r",stdin);
#endif
while(scanf("%d%d",&n,&m)&&(n>=0)&&(m>=0))
{
init();
memset(ma,0,sizeof(ma));
for (int i=0;i<n;i++)
{
scanf("%s",ma[i]);
}
for (int i=0;i<n;i++)
{
for (int j=0;j<m;j++)
{
if (i-1>=0)
{
if (t[ma[i][j]-'A'][0]==1 && t[ma[i-1][j]-'A'][2]==1)
{
intree(i*m+j,(i-1)*m+j);
}
}
if (j-1>=0)
{
if (t[ma[i][j]-'A'][1]==1 && t[ma[i][j-1]-'A'][3]==1)
{
intree(i*m+j,i*m+j-1);
}
}
if (i+1<=n)
{
if (t[ma[i][j]-'A'][2]==1 && t[ma[i+1][j]-'A'][0]==1)
{
intree(i*m+j,(i+1)*m+j);
}
}
if (j+1<=m)
{
if (t[ma[i][j]-'A'][3]==1 && t[ma[i][j+1]-'A'][1]==1)
{
intree(i*m+j,i*m+j+1);
}
}
}
}
printf("%d\n",ans);
}
return 0;
}