ZOJ Problem Set
来源:互联网 发布:php mysql 长连接 速度 编辑:程序博客网 时间:2024/06/11 07:01
Farm Irrigation
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
ADCFJKIHEthen 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.
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.
<b< dd="">
For each test case, output in one line the least number of wellsprings needed.
<b< dd="">
2 2DKHF3 3ADCFJKIHE-1 -1<b< dd="">
23
#include<stdio.h>#include<string.h>int n,m;int dis[12][4]={ {0,0,1,1} ,{1,0,0,1}, {0,1,1,0}, {1,1,0,0}, {0,1,0,1} ,{1,0,1,0}, {1,0,1,1}, {0,1,1,1}, {1,1,1,0} ,{1,1,0,1}, {1,1,1,1}};char map[60][60];int book[60][60];int vis[4][2]= {0,1,1,0, 0,-1,-1,0};void dfs(int x,int y,int s){ for(int i=0; i<4; i++) if(dis[s][i]) { int tx=x+vis[i][0]; int ty=y+vis[i][1]; int k=map[tx][ty]-'A'; if(!book[tx][ty]&&tx>=0&&ty>=0&&tx<n&&ty<m&&dis[k][(i+2)%4]) { book[tx][ty]=1; dfs(tx,ty,k); } }}int main(){ while(scanf("%d %d",&n,&m)&&(n!=-1&&m!=-1)) { int i,j,sum=0; memset(book,0,sizeof(book)); for(i=0; i<n; i++) scanf("%s",map[i]); for(i=0; i<n; i++) for(j=0; j<m; j++) if(!book[i][j]) { book[i][j]=1; sum++; dfs(i,j,map[i][j]-'A'); } printf("%d\n",sum); } return 0;}
- ZOJ Problem Set - 2060
- ZOJ Problem Set - 2972
- ZOJ Problem Set - 1037
- ZOJ Problem Set - 1048
- ZOJ Problem Set - 1049
- ZOJ Problem Set - 1051
- ZOJ Problem Set - 1067
- ZOJ Problem Set - 1115
- ZOJ Problem Set - 1151
- ZOJ Problem Set - 1205
- ZOJ Problem Set - 1025
- ZOJ Problem Set - 1029
- ZOJ Problem Set - 1076
- ZOJ Problem Set - 1117
- ZOJ Problem Set - 1041
- ZOJ Problem Set - 1004
- ZOJ Problem Set - 1005
- ZOJ Problem Set - 1016
- 字符串处理函数 1
- 字符串处理函数 2
- hdu 2094 产生冠军 模拟 大水题
- 自定义实现神奇的卡片切换效果
- idea 怎么调出maven界面
- ZOJ Problem Set
- JS判断安卓浏览器和ios浏览器区别
- CSS中position:fixed实现div居中及div内元素实现居中的方法
- 浏览器显示The requested URL *** was not found on this server
- (2)详解Socket类
- EF连接gpsql数据库操作笔录
- AngularJS按需加载文件
- android应用程序组件概述
- 当前状态企业架构蓝图是什么?