ZOJ Problem Set - 2412 Farm Irrigation
2017-07-10 13:24
155 查看
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
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.
<b< dd="">
Output
For each test case, output in one line the least number of wellsprings needed.
<b< dd="">
Sample Input
2 2
DK
HF
3 3
ADC FJK IHE
-1 -1
<b< dd="">Sample Output
2 3
注意:方向,不能胡乱写。
#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 - 1649 - Rescue
- ZOJ Problem Set - 1037 Gridland
- One Person Game ZOJ Problem Set - 3329
- ZOJ Problem Set - 3822Domination(DP)
- ZOJ Problem Set - 1730 Crazy Tea Party
- ZOJ Problem Set - 2818 Root of the Problem
- ZOJ Problem Set - 1048
- ZOJ Problem Set - 2679 Old Bill
- ZOJ Problem Set - 1970 All in All
- ZOJ Problem Set - 3787
- ZOJ Problem Set - 1078 Palindrom Numbers
- ZOJ Problem Set - 1007 Numerical Summation of a Series
- ZOJ Problem Set - 2412解题报告
- Java BeansZOJ Problem Set - 3714 the 10th 浙江ACM赛
- ZOJ Problem Set - 3702 Gibonacci number
- ZOJ Problem Set - 2104 Let the Balloon Rise
- ZOJ Problem Set - 3665 Yukari's Birthda
- ZOJ Problem Set - 2001 Adding Reversed Numbers
- ZOJ Problem Set - 1002
- ZOJ Problem Set - 1292