Heavy Transportation

Time Limit: 3000MS Memory Limit: 30000K

Total Submissions: 32946 Accepted: 8740

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

题意：一个人带着东西想从a点到b点，要经过的街道有一定的承重力，求所有通路中最大承重力的最大值；跟poj2253差不多，正好与这个题相反

#include
     
      #include
      
       #define min(a,b) (a
       
        maxx)                maxx=d[j],v=j;//求各个通路中的最大承重力        if(!maxx)            break;        vis[v]=1;        for(j=1; j<=n; j++)            if(!vis[j]&&d[j]
       
      
     

复习了一下，理解更清晰了，也找到了错误点

#include
     
      #include
      
       #include
       
        #include
        
         #include
         
          using namespace std;#define mem(a) memset(a,0,sizeof(a))const int maxn=1005;int map[maxn][maxn];int dis[1000005],vis[1000005];int n,m;void Dijkstra(int st,int ed){    mem(vis);    for(int i=1; i<=n; i++)    {        dis[i]=map[i][st];    }    vis[st]=1;    for(int i=1; i
          
           maxx) maxx=dis[j],point=j; vis[point]=1; for(int j=1; j<=n; j++) { if(!vis[j]&&dis[j]