ZOJ 2412 Farm Irrigation
2016-05-16 23:43
399 查看
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.
//大意就是许多方格农田呈矩形排布,每块农田上有各自的水管布局,水管能对接起来的农田间水可以互相流通
//求至少需要多少水源,能让水流遍所有农田
![](http://7xjob4.com1.z0.glb.clouddn.com/cc88efe29e1690a6180b304bcbb76696)
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
then the water pipes are distributed like
![](http://7xjob4.com1.z0.glb.clouddn.com/110db5505136d256fd5c5f99b3fac875)
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
Sample Output
Source
Zhejiang University Local Contest 2005
本质上是很普通的DFS,但是加上那么多类型的水管就有些闹心了
打个表列举每种水管布局,剩下的就是裸DFS
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
Source
Zhejiang University Local Contest 2005
本质上是很普通的DFS,但是加上那么多类型的水管就有些闹心了
打个表列举每种水管布局,剩下的就是裸DFS
#include<iostream> #include<cstdio> #include<algorithm> #include<cmath> #include<cstring> // #define RLQ main // using namespace std; char map[100][100]; int mx[5]={0,-1,0,1,0},//空 上右下左 my[5]={0,0,1,0,-1}; int m,n; int ans; int pd(int ch,int i){ switch(ch){ case 'A':return i==1||i==4; case 'B':return i==1||i==2; case 'C':return i==3||i==4; case 'D':return i==2||i==3; case 'E':return i==1||i==3; case 'F':return i==2||i==4; case 'G':return i==1||i==4||i==2; case 'H':return i==1||i==3||i==4; case 'I':return i==2||i==3||i==4; case 'J':return i==1||i==2||i==3; case 'K':return 1; } } void dfs(int x,int y){ char ch=map[x][y]; map[x][y]='M';//标记为已灌溉 int i; for(i=1;i<=4;i++)//上 右 下 左 if(pd(ch,i)){//判断能否从这个方向出去 int x1=x+mx[i]; int y1=y+my[i]; if(x1>0 && x1<=m && y1>=0 && y1<n && map[x1][y1]!='M'){ if(pd(map[x1][y1],(i+1)%4+1))//判断和下一个区块的联通 dfs(x1,y1); } } return; } int RLQ(){ int i,j; while(scanf("%d%d",&m,&n) && m!=-1 && n!=-1){ ans=0; for(i=1;i<=m;i++)scanf("%s",map[i]); for(i=1;i<=m;i++) for(j=0;j<n;j++){ if(map[i][j]!='M') ans++,dfs(i,j); //TEST// for(int k=1;k<=m;k++)printf("%s\n",map[k]); } printf("%d\n",ans); } return 0; }
相关文章推荐
- hdu_2224_The shortest path(dp)
- 利用组合控件实现布局文件抽取复用
- 300. Longest Increasing Subsequence
- hdu-5668- Circle 逆元+卡特兰数知识模板
- JAVA——OutputStream类和InputStream类
- markdown
- Android Handler和他的小伙伴们,消息机制详解
- android半透明引导页
- 2016"百度之星" - 资格赛————Problem D
- 海量数据的KNN分类、Kmeans聚类
- makefile&Android mk文件中打印log
- 算字母
- (11)以对象管理资源
- php-fpm 的安装与LNMP测试
- Java多线程与并发(六)之线程池
- leetcode 122. Best Time to Buy and Sell Stock II
- 从数据库(Mysql)进行增导入输入到Solr中
- 新手教程之使用Xib自定义UITableViewCell
- Java实现一个简单的租车系统
- getlin与get的区别