POJ1797(Heavy Transportation)

Heavy Transportation

 

Description

Background
Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his customer has build his giant steel crane to the place where it is needed on which all streets can carry the weight.
Fortunately he already has a plan of the city with all streets and bridges and all the allowed weights.Unfortunately he has no idea how to find the the maximum weight capacity in order to tell his customer how heavy the crane may become. But you surely know.

Problem
You are given the plan of the city, described by the streets (with weight limits) between the crossings, which are numbered from 1 to n. Your task is to find the maximum weight that can be transported from crossing 1 (Hugo's place) to crossing n (the customer's place). You may assume that there is at least one path. All streets can be travelled in both directions.

Input

The first line contains the number of scenarios (city plans). For each city the number n of street crossings (1 <= n <= 1000) and number m of streets are given on the first line. The following m lines contain triples of integers specifying start and end crossing of the street and the maximum allowed weight, which is positive and not larger than 1000000. There will be at most one street between each pair of crossings.

Output

The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing the maximum allowed weight that Hugo can transport to the customer. Terminate the output for the scenario with a blank line.

Sample Input

1
3 3
1 2 3
1 3 4
2 3 5

Sample Output

Scenario #1:
4

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

#define  MAXN 1020
#define  INFF INT_MAX

struct  point 
{ 
    int vex, cost; 
    bool operator <(const point it)const 
    {
        return cost < it.cost;
    } 
} ;

int  graph[MAXN][MAXN];
int  D[MAXN];
int  Visited[MAXN];
int  n, m;

int  Djikstra()
{
    priority_queue<point> Q;
    int maxv, i, k=0;
    int vex;
    point pp;

    /**////初始化/
    for(i=1; i<=n; i++)
    {
        Visited[i] = false;
        D[i] = 0;
    }

    pp.vex = 1; pp.cost = INFF;
    Q.push( pp);
    D[1]=INFF;
        
    while(k<n && !Q.empty())
    {
        pp = Q.top();
        Q.pop();
        vex = pp.vex;
        maxv = pp.cost;
        if(Visited[vex])continue;
        k++;

        if(vex == n)
            return D[n];

        Visited[vex] = true;

        for(i=1; i<=n; i++)
        {/**/////
            //这里是关键部分，以为是单源路径D[i] < maxv是必须
            //Dijkstra变形求网络流的改变即在此
            if(!Visited[i] && D[i]<graph[vex][i] && D[i]<maxv )
            {
                D[i] = min (maxv , graph[vex][i]);
                pp.vex = i; pp.cost = D[i];
                Q.push(pp);
            }
        }/**////
    }
        return 0;
}

int  main()
{
    int i, j, a, b, cost, T;
    scanf("%d", &T);

    for(int k = 1; k <= T; k++)
    {
        scanf("%d%d", &n, &m);
            for(i=1 ;i<=n; i++)
                for(j=1; j<=n; j++)
                    graph[i][j] = 0;
        while ( m-- )
        {
            scanf("%d %d %d", &a, &b, &cost);
            graph[a][b] = graph[b][a] = cost;
        }

        printf ("Scenario #%d:\n%d\n\n", k, Djikstra());
    }
    return 0;
}

转载于:https://www.cnblogs.com/Xredman/archive/2009/04/19/1439119.html