Poj 1979 Red and Black

Language: DefaultEspañol Red and Black Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 27802   Accepted: 15097 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.  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)  The end of the input is indicated by a line consisting of two zeros.  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 Source Japan 2004 Domestic 基本思路：暴力搜索全部能够走的点 AC代码如下 #include <iostream> #include <cstring> using namespace std; const int maxn=20+5; int vis[maxn][maxn]; char mp[maxn][maxn]; int xx[]={1,-1,0,0}; int yy[]={0,0,-1,1}; int cnt; int w,h; void dfs(int x,int y){ vis[x][y]=1; mp[x][y]='#'; for(int i=0;i<4;i++){ int tx=xx[i]+x; int ty=yy[i]+y; if(!vis[tx][ty] && mp[tx][ty]=='.' && tx>=0 && tx<w && ty>=0 && ty<h){ cnt++; dfs(tx,ty); } } } int main(){ while(cin>>h>>w && h && w){ int tx,ty; cnt=1; memset(vis,0,sizeof(vis)); for(int i=0;i<w;i++) { cin>>mp[i]; for(int j=0;j<h;j++){ if(mp[i][j]=='@'){ tx=i,ty=j; mp[i][j]='#'; } } } dfs(tx,ty); cout<<cnt<<endl; } return 0; }