poj1979 Red and Black

Red and Black Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 24297   Accepted: 13090 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

题意：给你n*m的矩阵，上面涂着红色或者黑色，你能朝四个方向走，但是只能移动在黑色方块上，问你能到达几块黑色方块。

做法：直接回溯。

#include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cstdio>
#include<vector>
#include<cstring>
#include<cmath>
using namespace std;
int dx[4]={0,0,-1,1};
int dy[4]={-1,1,0,0};
int vis[25][25];
char mm[25][25];
int ans;
int n,m;
void solve(int x,int y)
{
    int xx,yy;
    int i;
    ans++;
    vis[x][y]=1;
    for(i=0;i<4;i++)
    {
        xx=x+dx[i];
        yy=y+dy[i];
        if(mm[xx][yy]!='#'&&vis[xx][yy]==0&&xx>=0&&xx<n&&yy>=0&&yy<m)
        {
            solve(xx,yy);
        }
    }
}
int main()
{
    int i,j;
    int st,ed;
    while(scanf("%d%d",&m,&n)&&n&&m)
    {
        getchar();
        memset(vis,0,sizeof(vis));
        ans=0;
        for(i=0;i<n;i++)
        {
            gets(mm[i]);
            for(j=0;j<m;j++)
            {
                if(mm[i][j]=='@')
                {
                    st=i;
                    ed=j;
                }
            }
        }
        solve(st,ed);
        printf("%d\n",ans);
    }
}