zoukankan      html  css  js  c++  java
  • #图# #最大生成树# #kruskal# ----- OpenJudge 799:Heavy Transportation

    OpenJudge 799:Heavy Transportation

    总时间限制: 3000ms 内存限制: 65536kB

    描述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.输入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.输出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.样例输入

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

    样例输出

    Scenario #1:
    4

     1 #include<cstdio>
     2 #include<algorithm>
     3 using namespace std;
     4 
     5 int T,t,n,m;
     6 int fa[1100];
     7 
     8 struct node{
     9     int u;
    10     int v;
    11     int w;
    12 }edge[5000005];
    13 
    14 int cmp(node a,node b){
    15     return a.w>b.w;
    16 }
    17 
    18 int getfa(int x){
    19     return fa[x]=fa[x]==x?x:getfa(fa[x]);
    20 }
    21 
    22 int kruskal(){
    23     int ans;
    24     sort(edge+1,edge+m+1,cmp);
    25     for(int i=1;i<=n;++i)fa[i]=i;
    26     for(int i=1;i<=m;++i){
    27         int U=getfa(edge[i].u);
    28         int V=getfa(edge[i].v);
    29         if(U!=V){
    30             fa[U]=V;
    31             ans=edge[i].w;
    32             if(getfa(1)==getfa(n))return ans;//1---n连通即可不一定要走完整个树 
    33         }
    34     }
    35 }
    36 
    37 int main(){
    38     scanf("%d",&T);
    39     t=1;
    40     while(t<=T){
    41         scanf("%d%d",&n,&m);
    42         for(int i=1;i<=m;++i)scanf("%d%d%d",&edge[i].u,&edge[i].v,&edge[i].w);
    43         printf("Scenario #%d:
    %d
    
    ",t,kruskal());
    44         t++;
    45     }
    46     return 0;
    47 } 
  • 相关阅读:
    java struts2入门学习实例--用户注册
    java struts2入门学习实例--将客户端IP地址和访问方式输出到浏览器
    struts2基本配置详解2
    struts2基本配置详解
    使用maven+eclipse搭建最简单的struts2的HelloWorld
    2013年总结
    linux shell 脚本攻略学习20--awk命令入门详解
    linux shell 脚本攻略学习19--sed命令详解
    linux shell 脚本攻略学习18--grep命令详解
    linux shell 脚本攻略学习17--正则表达式入门
  • 原文地址:https://www.cnblogs.com/wjting/p/6026414.html
Copyright © 2011-2022 走看看