ZOJ1047( 深度优先搜索)

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<memory.h>
#include<cstdio>
#include<list>
#include<string>
#include<map>
#include<cmath>
#include <algorithm>
#include <queue>

#define NUM 25
#define maxint 10000000
#define INF 0x3f3f3f3f
#define Max 5001
using namespace std;

int n;//方块的大小
int q;//方块类型
int iSquare[25][4];//放的是种类i的方块的类型。
int iCount[25];//放的是每种方块的个数
int iTable[25];//放的是最后方块的排列
char s[NUM][NUM];

int row , cloumn;
int x, y;
int direct[][2] = {{1,1},{-1,1},{-1,-1},{1,-1}};
int total = 0;
int dir[][2] = {{0,1},{1,0},{-1,0},{0,-1}};
int duijiao[][2] = {{1,1},{-1,1},{-1,-1},{1,-1}};
bool flag[25][25];

void pos(int x ,int y)
{
    int count = 0;
    flag[x][y] = 1;
    int newx,newy;
    for(int i = 0;i<4;i++)
    {
        newx = x+dir[i][0];
        newy = y+dir[i][1];
        if(s[newx][newy] == 'X' && flag[newx][newy] == 0)
        {
            flag[newx][newy] = 1;
            pos(newx, newy);
        }
        else if (s[newx][newy] == '.')
        {
            total++;
            flag[newx][newy] = 1;
        }
    }
    for(int i = 0;i<4;i++)
    {
        newx = x+duijiao[i][0];
        newy = y+duijiao[i][1];
        if(s[newx][newy] == 'X' && flag[newx][newy] == 0)
        {
            flag[newx][newy] = 1;
            pos(newx, newy);
        }
    }
    
    
    
    return ;
}

int main()
{
    freopen("in.txt", "r", stdin);
    
    while(scanf("%d%d%d%d",&row , &cloumn , &x , &y)!=EOF && (row||cloumn||x||y))
    {
        memset(s, '.', sizeof(s));
        memset(flag, 0, sizeof(flag));
        char image[40];
        for(int i = 1;i<=row;i++)
        {
            scanf("%s",&image);
            for(int j = 1;j<=cloumn;j++)
            {
                s[i][j] = image[j-1];
            }
        }
        total = 0;
        pos(x, y);
        cout<<total<<endl;
    }
    
  
    
    
}