UVA 1600 Patrol Robot(机器人穿越障碍最短路线BFS) 解题心得

原题：

Description

 

A robot has to patrol around a rectangular area which is in a form of mxn grid (m rows and n columns). The rows are labeled from 1 to m. The columns are labeled from 1 to n. A cell (i, j) denotes the cell in row i and column j in the grid. At each step, the robot can only move from one cell to an adjacent cell, i.e. from (x, y) to (x + 1, y), (x, y + 1), (x - 1, y) or (x, y - 1). Some of the cells in the grid contain obstacles. In order to move to a cell containing obstacle, the robot has to switch to turbo mode. Therefore, the robot cannot move continuously to more than kcells containing obstacles.

Your task is to write a program to find the shortest path (with the minimum number of cells) from cell (1, 1) to cell(m, n). It is assumed that both these cells do not contain obstacles.

Input 

The input consists of several data sets. The first line of the input file contains the number of data sets which is a positive integer and is not bigger than 20. The following lines describe the data sets.

For each data set, the first line contains two positive integer numbers m and n separated by space (1m, n20). The second line contains an integer number k(0k20). The i^th line of the next m lines contains n integer a_ijseparated by space (i = 1, 2,..., m;j = 1, 2,..., n). The value of a_ij is 1 if there is an obstacle on the cell (i, j), and is 0otherwise.

Output 

For each data set, if there exists a way for the robot to reach the cell (m, n), write in one line the integer number s, which is the number of moves the robot has to make; -1 otherwise.

Sample Input 

3 
2 5 
0 
0 1 0 0 0 
0 0 0 1 0 
4 6 
1 
0 1 1 0 0 0
0 0 1 0 1 1
0 1 1 1 1 0
0 1 1 1 0 0
2 2 
0 
0 1 
1 0

Sample Output 

7 
10 
-1

我的代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>

using namespace std;

int directionX[] = { 1, 0, -1, 0 };
int directionY[] = { 0, 1, 0, -1 };
int m, n, k, able;
int counts[25][25] = { 0 };
int map[25][25] = { 0 };
int Min;



struct location
{
    int x, y, step;
    int k;
    location() :x(1), y(1), step(0),k(0) {}
    bool operator ==(location &b)  { return x == b.x&&y == b.y; }
}start,target;

bool check(location & a)
{
    if (a.x<1 || a.x>m || a.y<1 || a.y>n)        return 0;
    if (counts[a.x][a.y] != 0)            
        return 0;
    if (map[a.x][a.y] == 1)
    {
        if (a.k <= 0)            return 0;
        a.k--; return 1;
    }
    if (map[a.x][a.y] == 0)
    {
        a.k = able;
        return 1;
    }

}

int dfs(location & start)
{
    location old_location, new_location;
    queue<location> q;
    old_location = start;
    q.push(old_location);
    counts[old_location.x][old_location.y] = 1;
    while (!q.empty())
    {
        old_location = q.front();
        q.pop();
        for (int i = 0; i < 4; i++)
        {
            new_location.x = old_location.x + directionX[i];
            new_location.y = old_location.y + directionY[i];
            new_location.k = old_location.k;
            if (!check(new_location))                
                continue;
            if (new_location == target)
                return old_location.step + 1;
            counts[new_location.x][new_location.y] = 1;
            new_location.step = old_location.step + 1;
            q.push(new_location);
        }
    }
    return -1;
}




int main() 
{
    int t;
    cin >> t;
    while (t--)
    {
        cin >> m >> n>>k;
        target.x = m; target.y = n;
        start.k = k;
        able = start.k;
        memset(counts, 0, sizeof(counts));
        memset(map, 0, sizeof(map));
        for (int i = 1; i <= m; i++)
        {
            for (int j = 1; j <= n; j++)
            {
                cin >> map[i][j];
            }
        }
        if (target == start)            Min = 0;
        else
        {
            Min = dfs(start);
        }
        cout << Min << endl;
    }
    

    return 0;
}