Description
Write a program to count the number of black tiles which he can reach by repeating the moves described above.
Input
There are H more lines in the data set, each of which includes W characters. Each character represents the color of a tile as follows.
'.' - a black tile
'#' - a red tile
'@' - a man on a black tile(appears exactly once in a data set)
The end of the input is indicated by a line consisting of two zeros.
Output
Sample Input
6 9 ....#. .....# ...... ...... ...... ...... ...... #@...# .#..#. 11 9 .#......... .#.#######. .#.#.....#. .#.#.###.#. .#.#..@#.#. .#.#####.#. .#.......#. .#########. ........... 11 6 ..#..#..#.. ..#..#..#.. ..#..#..### ..#..#..#@. ..#..#..#.. ..#..#..#.. 7 7 ..#.#.. ..#.#.. ###.### ...@... ###.### ..#.#.. ..#.#.. 0 0
Sample Output
45 59 6 13
题目大意:输入一个矩阵只有一个'@',其他都是‘.’或'#','#'代表红色砖块‘.’代表黑色砖块,‘@’,是人站的初始位置,只能走黑色砖块,输出一共能走多少个黑色砖块,含脚下的一个。
题目链接:http://poj.org/problem?id=1979
源代码:
#include<cstdio>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
char a[20][20];
int d[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
int sum,l,h;
bool yj(int x,int y)
{
if(x<0||y<0||x>=h|y>=l)
return 0;
return 1;
}
void search1(int x,int y)
{
int xx,yy;
int i;
sum++;
a[x][y]='#';
for(i=0;i<4;i++)
{
xx=x+d[i][0];
yy=y+d[i][1];
if(yj(xx,yy)&&(a[xx][yy]=='.'))
search1(xx,yy);
}
}
int main()
{
int i,j,x0,y0;
while(~scanf("%d%d",&l,&h))
{
getchar();
if(l==0&&h==0)
break;
sum=0;
for(i=0;i<h;i++)
{
for(j=0;j<l;j++)
{
scanf("%c",&a[i][j]);
if(a[i][j]=='@')
{
x0=i;
y0=j;
}
}
getchar();
}
search1(x0,y0);
printf("%d\n",sum);
}
return 0;
}