TOJ--3100:Getting Gold (DFS)

1. 题目源地址：http://acm.tju.edu.cn/toj/showp3100.html

2. 源代码：

//TOJ--3100:Getting Gold
#include<iostream>
#include<memory.h>
#include<stdio.h>
using namespace std;

char map[55][55];
int visited[55][55];
int W,H,sum; 
int start_x,start_y;

bool InMap(int x,int y)
{
   if(x>=1 && x<=H && y>=1 && y<=W)
      return true;
   else
      return false; 
} 

void DFS(int x,int y)
{    
    visited[x][y]=1;
    
    if(map[x][y]=='G')  
    {
       sum++;
       visited[x][y]=1;
    }
    
    if(map[x-1][y]=='T' || map[x+1][y]=='T' || map[x][y-1]=='T' || map[x][y+1]=='T')
       return ;
       
    else
    {
        if(!visited[x-1][y] && map[x-1][y]!='#' && InMap(x-1,y))
           DFS(x-1,y);
           
        if(!visited[x+1][y] && map[x+1][y]!='#' && InMap(x+1,y))
           DFS(x+1,y);
           
        if(!visited[x][y-1] && map[x][y-1]!='#' && InMap(x,y-1))
           DFS(x,y-1);
           
        if(!visited[x][y+1] && map[x][y+1]!='#' && InMap(x,y+1))
           DFS(x,y+1);
    }
}

int main()
{
    int i,j;
    while(cin>>W>>H)
    {
       getchar();
       
       for(i=1;i<=H;i++)
          for(j=1;j<=W;j++)
          {
             cin>>map[i][j];
             if(map[i][j]=='P')
             {
                start_x=i;
                start_y=j;
             }
          }
       sum=0;
      
       DFS(start_x,start_y);
       cout<<sum<<endl;
    }
    return 0;
}