您的位置:首页 > 理论基础 > 数据结构算法

hdu1198(并查集)

2013-07-30 19:47 225 查看

Farm Irrigation

[b]Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 4146    Accepted Submission(s): 1797
[/b]

[align=left]Problem Description[/align]
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.

 

[align=left]Input[/align]
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.

 

[align=left]Output[/align]
For each test case, output in one line the least number of wellsprings needed.

 

[align=left]Sample Input[/align]

2 2
DK
HF

3 3
ADC
FJK
IHE

-1 -1

 

[align=left]Sample Output[/align]

2
3 本题问连不连通,是个典型的并查集题目,采用双重循环,没来一个字符,依据题目要求分别判断他与左边和上边是否联通 
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  数据结构 并查集