Farm Irrigation+DFS
来源:互联网 发布:淘宝手机端装修视频 编辑:程序博客网 时间:2024/06/03 23:39
Farm Irrigation
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3773 Accepted Submission(s): 1649
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.
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
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 2DKHF3 3ADCFJKIHE-1 -1
Sample Output
23/*思路:DFS*/#include<cstdio>#include<iostream>using namespace std;int num,M,N;int pdirect[13][4]={{0,0,0,0},{1,0,0,1},{1,1,0,0},{0,0,1,1},{0,1,1,0},{1,0,1,0},{0,1,0,1},{1,1,0,1},{1,0,1,1},{0,1,1,1},{1,1,1,0},{1,1,1,1},{0,0,0,0}};int graph[53][53];void dfs(int x,int y){if(graph[x][y]==0)return;int a=graph[x][y];graph[x][y]=0; //类似于标记if(pdirect[a][0]==1&&pdirect[graph[x-1][y]][2]==1) dfs(x-1,y);if(pdirect[a][2]==1&&pdirect[graph[x+1][y]][0]==1) dfs(x+1,y);if(pdirect[a][3]==1&&pdirect[graph[x][y-1]][1]==1)dfs(x,y-1);if(pdirect[a][1]==1&&pdirect[graph[x][y+1]][3]==1)dfs(x,y+1);}int main(){int i,k,j,l,m,n;char c;while(scanf("%d %d",&M,&N)!=EOF){if(M<0||N<0)break;memset(graph,0,sizeof(graph));num=0;for(i=1;i<=M;i++)for(j=1;j<=N;j++){cin>>c;graph[i][j]=c-'A'+1;}for(i=1;i<=M;i++)for(j=1;j<=N;j++){if(graph[i][j]!=0){num++;dfs(i,j);}}printf("%d\n",num);}return 0;}
- zoj Farm Irrigation dfs
- Farm Irrigation+DFS
- Farm Irrigation(dfs)
- hdu1198 Farm Irrigation dfs
- hdu1198 Farm Irrigation DFS
- hdu1198 Farm Irrigation(DFS)
- HDOJ1198 Farm Irrigation(DFS)
- hdu1198 Farm Irrigation (DFS)
- ZOJ2412 Farm Irrigation (DFS)
- zoj 2412 Farm Irrigation #DFS
- zoj2412 Farm Irrigation 搜索dfs
- zoj 2412 Farm Irrigation dfs
- ZOJ 2412 Farm Irrigation(DFS)
- zoj 2412 Farm Irrigation(DFS~)
- zoj2412 & hdu1198 - Farm Irrigation (DFS实现)
- ZOJ 2412 Farm Irrigation (DFS+模拟)
- HDU 1198 Farm Irrigation(DFS)
- HDU 1198 Farm Irrigation(dfs)
- dataguard 备库重做记录
- 项目总结
- 11.4
- ext2在内存中的数据结构
- JDBC之通过ResultSet对象对结果集进行处理
- Farm Irrigation+DFS
- 16个经典面试问题及回答思路
- 数据可视化几个工具
- wav文件解析
- ListView显示SD卡中的图片
- 面试必读的面试礼节
- SVN客户端安装配置和使用(windows)
- 从函数重载到函数模板
- warning