1010.cpp

杭电 acm部分代码 有兴趣的可以下载 谢谢

#include<iostream>
#include<string>
#include<cmath>
using namespace std;
int dir[4][2] = {{0,-1},{0,1},{-1,0},{1,0}};
int m, n, t, x, y, xd, yd, wallnum;
char wall[10][10];
bool finish;
void dfs(int a, int b, int times)
{
    if(a <= 0 || b <= 0 || a > m || b > n)
        return;
    if(a == xd && b == yd && times == t)
        finish = true;
    if(finish == true)
        return;
    int temp = t - times - abs(a - xd) - abs(b - yd);
    if(temp < 0 || temp & 1)
        return;
    for(int i = 0; i < 4; i++)
    {
        if(wall[a + dir[i][0]][b + dir[i][1]] != 'X')
        {
            wall[a + dir[i][0]][b + dir[i][1]] = 'X';
            dfs(a + dir[i][0], b + dir[i][1], times + 1);
            wall[a + dir[i][0]][b + dir[i][1]] = '.';
        }
    }
}
int main()
{
    while(cin >> m >> n >> t)
    {
        if(m == 0 && n == 0 && t == 0)
            break;
        memset(wall, 0, sizeof(wall));
        wallnum = 0;
        for(int i = 1; i <= m; i++)
            for(int j = 1; j <= n; j++)
            {
				cin >> wall[i][j];
                if(wall[i][j] == 'S')
                {
                    x = i;
                    y = j;
                }
                else if(wall[i][j] == 'X')
                {
                    wallnum++;
                }
				else if(wall[i][j] == 'D')
				{
					xd = i;
					yd = j;
				}
            }
        if(n * m - wallnum <= t)
        {
            cout << "NO" << endl;
            continue;
        }
        wall[x][y] = 'X';
        finish = false;
        dfs(x, y, 0);
        if(finish)
            cout << "YES" << endl;
        else
            cout << "NO" << endl;
    }
    return 0;
}