解题报告ZOJ2412.docVIP

解题报告ZOJ2412 Farm Irrigation Time Limit:?1 Second ?????Memory Limit:?32768 KB 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. 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 农田灌溉(Farm Irrigation) 题目描述： Benny有一大片农田需要灌溉。农田是一个长方形，被分割成许多小的正方形。每个正方形中都安装了水管。不同的正方形农田中可能安装了不同的水管。一共有11种水管，分别用字母A～K标明，如图2.11(a)所示。 Benny农田的地图是由描述每个正方形农田中水管类型的字母组成的矩阵。例如，如果农田的地图为： ADC FJK IHE 则农田中水管分布如图2.11(b)所示。 某些正方形农田的中心有水源，因此水可以沿着水管从一个正方形农田流向另一个正方形农田。如果水可以流经某个正方形农田，则整个正方形农田可以全部灌溉到。 Benny想知道至少需要多少个水源，以保证整个农田都能被灌溉到？ 例如，图2.11(b)所示的农田至少需要3个水源，图中的圆点表示每个水源。 输入描述： 输入文件中包含多个测试数据。每个测试数据的第1行为两个整数M和N，表示农田中有M行，每行有N个正方形。接下来有M行，每行有N个字符。字符的取值为A～K，表示对应正方形农田中水管的类型。当M或N取负值时