优先级队列 + 迪斯拉算法

 

Description

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 x 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 x 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).

Sample Input

 Copy sample input to clipboard

3
5 5 4
3 9 1
3 2 7
5
3 7 2 0 1
2 8 0 9 1
1 2 1 8 1
9 8 9 2 0
3 6 5 1 5
7
9 0 5 1 1 5 3
4 1 2 1 6 5 3
0 7 6 1 6 8 5
1 1 7 8 3 2 3
9 4 0 7 6 4 1
5 8 3 2 4 8 3
7 4 8 4 8 3 4
0

Sample Output

Problem 1: 20
Problem 2: 19
Problem 3: 36

速度非常好，达到0.1秒，另外一种是用set优化的，感觉这种更快，更简单

// source code of submission 724703, Zhongshan University Online Judge System
#include<cstdio>
#include<queue>
using namespace std;
const int MAX = 130;
const int MAXINT = 1000000000;
int             A[MAX][MAX];
bool            Exist[MAX][MAX];
typedef struct _Node
{
    int     x;
    int     y;
    int     path;
}Node;
bool    operator<( const Node & a , const Node & b )
{
    return a.path > b.path;
}
void GetNext( int beginX , int beginY , priority_queue<Node> & result , int n )
{
    static const int x[4] = {0,0,1,-1};
    static const int y[4] = {1,-1,0,0};
    Node    New;
    for( int i = 0 ; i != 4 ; ++i )
    {
        New.x = beginX + x[i]; New.y = beginY + y[i];
        if( New.x >= 0 && New.y >= 0 && New.x < n && New.y < n && !Exist[ New.x ][ New.y ] )
        {
            New.path = A[ beginX ][ beginY ] + A[New.x][New.y];
            result.push( New );
        }
    }
}
void Find( int n )
{
    for( int i = 0 ; i != n ; ++i )
        for( int j = 0 ; j != n ; ++j )
            Exist[ i ][ j ] = false;
    Node                    mid;
    priority_queue<Node>    QU;
    mid.x = mid.y = 0 ;mid.path = A[0][0]; 
    QU.push( mid );
    while( 1 )
    {
        mid = QU.top();
        QU.pop();
        if( Exist[mid.x][mid.y] )continue;
        Exist[ mid.x ][ mid.y ] = true;
        A[ mid.x ][ mid.y ] = mid.path ;
        if( mid.x == n - 1 && mid.y == n - 1 ) return ;
        GetNext( mid.x , mid.y , QU , n );
    }
}
int main()
{
    int n ,m = 0 ;
    while( scanf("%d",&n) , n != 0 )
    {
        for( int i = 0 ; i != n ; ++i )
            for( int j = 0 ; j != n ; ++j )
                scanf("%d",&A[i][j]);
        Find(  n );
        printf("Problem %d: %d/n", ++m , A[ n - 1 ][ n - 1 ]);
    }
    return 0;
}