HDU T3152 Obstacle Course

链接：http://acm.hdu.edu.cn/showproblem.php?pid=3152

You are working on the team assisting with programming for the Mars rover. To conserve energy, the rover needs to find optimal paths across the rugged terrain to get from its starting location to its final location. The following is the first approximation for the problem.

N * N square matrices contain the expenses for traversing each individual cell. For each of them, your task is to find the minimum-cost traversal from the top left cell [0][0] to the bottom right cell [N-1][N-1]. Legal moves are up, down, left, and right; that is, either the row index changes by one or the column index changes by one, but not both.

 

 

Input

Each problem is specified by a single integer between 2 and 125 giving the number of rows and columns in the N * N square matrix. The file is terminated by the case N = 0.

Following the specification of N you will find N lines, each containing N numbers. These numbers will be given as single digits, zero through nine, separated by single blanks.

 

 

Output

Each problem set will be numbered (beginning at one) and will generate a single line giving the problem set and the expense of the minimum-cost path from the top left to the bottom right corner, exactly as shown in the sample output (with only a single space after "Problem" and after the colon).

 

BFS + 优先队列优化

简单题

#include <cstdio>
#include <queue>
using namespace std;

struct cord {
    int x, y;
    int sum;
    friend bool operator<(cord x, cord y) {
        return x.sum > y.sum;
    }
};

int main() {
    int kase = 1;
    int dir[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
    int N;

    while(~scanf("%d", &N) && N) {
        int mapp[N][N];
        bool visited[N][N];

        for(int i = 0; i < N; i++) {
            for(int j = 0; j < N; j++) {
                scanf("%d", &mapp[i][j]);
                visited[i][j] = false;
            }
        }

        cord x, y;
        priority_queue<cord> pq;
        x.x = 0;x.y = 0;
        x.sum = mapp[0][0];
        pq.push(x);

        while(!pq.empty()) {
            x = pq.top();pq.pop();
            if(x.x == N-1 && x.y == N-1) {
                printf("Problem %d: %d\n", kase++, x.sum);
                break;
            }

            for(int i = 0; i < 4; i++) {
                y.x = x.x + dir[i][0];
                y.y = x.y + dir[i][1];
                if(y.x < 0 || y.x >= N || y.y < 0 || y.y >= N || visited[y.x][y.y] == true) {
                    continue;
                }
                y.sum = x.sum + mapp[y.x][y.y];
                pq.push(y);
                visited[y.x][y.y] = true;
            }
        }
    }
    return 0;
}