Red and Black
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 19832 Accepted Submission(s): 12048
Total Submission(s): 19832 Accepted Submission(s): 12048
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 <algorithm> #include <string.h> using namespace std; char mp[25][25]; int fx[4]={0,1,0,-1},fy[4]={1,0,-1,0}; int ans=0; int n,m; void dfs(int x,int y) { ans++; mp[x][y] = '#'; for(int i=0; i<4; i++) { int dx = x + fx[i]; int dy = y + fy[i]; if(dx>=0&&dx<m&&dy>=0&&dy<n) { if(mp[dx][dy]=='.') dfs(dx,dy); } } return ; } int main(){ while(~scanf("%d%d",&n,&m),n||m) { ans=0; for(int i=0; i<m; i++) { scanf("%s",&mp[i]); } for(int i=0; i<m; i++) for(int j=0; j<n; j++) { if(mp[i][j]=='@') { mp[i][j]='#'; dfs(i,j); break; } } printf("%d\n",ans); } return 0; }