Red and Black
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19055 Accepted Submission(s): 11562
Problem Description
There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can't move on red tiles, he can move only on black tiles.
Write a program to count the number of black tiles which he can reach by repeating the moves described above.
Write a program to count the number of black tiles which he can reach by repeating the moves described above.
Input
The input consists of multiple data sets. A data set starts with a line containing two positive integers W and H; W and H are the numbers of tiles in the x- and y- directions, respectively. W and H are not more than 20.
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)
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)
Output
For each data set, your program should output a line which contains the number of tiles he can reach from the initial tile (including itself).
Sample Input
6 9 ....#. .....# ...... ...... ...... ...... ...... #@...# .#..#. 11 9 .#......... .#.#######. .#.#.....#. .#.#.###.#. .#.#..@#.#. .#.#####.#. .#.......#. .#########. ........... 11 6 ..#..#..#.. ..#..#..#.. ..#..#..### ..#..#..#@. ..#..#..#.. ..#..#..#.. 7 7 ..#.#.. ..#.#.. ###.### ...@... ###.### ..#.#.. ..#.#.. 0 0
Sample Output
45 59 6 13
代码:
#include <iostream>
#include<stdio.h>#include<string.h>
using namespace std;
char grid[21][21];
int vis[21][21];
int dx[4]={-1,0,0,1};
int dy[4]={0,-1,1,0};
int m,n;
int count;
void dfs(int bx,int by)
{
count++;
vis[bx][by]=1;
for(int i=0;i<4;i++)
{
if(bx+dx[i]>=0&&bx+dx[i]<m&&by+dy[i]>=0&&by+dy[i]<n&&grid[bx+dx[i]][by+dy[i]]=='.'&&vis[bx+dx[i]][by+dy[i]]==0)
{
dfs(bx+dx[i],by+dy[i]);
}
}
}
int main()
{
while(scanf("%d%d",&n,&m)!=EOF&&!(n==0&&m==0))
{
count=0;
memset(vis,0,sizeof(vis));
for(int i=0;i<m;i++)
{
scanf("%s",grid[i]);
}
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
if(grid[i][j]=='@')
{
dfs(i,j);break;
}
}
}
printf("%d\n",count);
}
return 0;
}