zoukankan      html  css  js  c++  java
  • POJ 1797 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

    大意:

    Hugo Heavy要从城市1到城市N运送货物,有M条道路,每条道路都有它的最大载重量,问从城市1到城市N运送最多的重量是多少。



    思路:

    这道题我们可以采用类似于求最短路径的方法,用一种新的“松弛操作”去取代原本的方法。 我们可以记录d[u]为运送货物到点j时最大可载重量。那么对于一条边(x,y),我们有d[y]=max(d[y],min(d[x],v(x,y))).

    #include<queue>
    #include<cstdio>
    #include<iostream>
    #define MAXN 1010
    using namespace std;
    int n,m,t,tot,map[MAXN][MAXN],dis[MAXN];
    bool b[MAXN];
    queue<int> q;
    inline void read(int&x) {
        x=0;int f=1;char c=getchar();
        while(c>'9'||c<'0') {if(c=='-') f=-1;c=getchar();}
        while(c>='0'&&c<='9') {x=(x<<1)+(x<<3)+c-48;c=getchar();}
        x=x*f;
    }
    inline void spfa() {
        for(int i=1;i<=n;i++) {dis[i]=0;b[i]=0;}
        q.push(1);
        b[1]=true;
        while(!q.empty()) {
            int u=q.front();
            q.pop();
            b[u]=false;
            for(int i=1;i<=n;i++) {
                if(u==1&&map[u][i]) {
                    dis[i]=map[u][i];
                    q.push(i);
                    b[i]=true;
                    continue;
                }
                if(dis[i]<min(dis[u],map[u][i])) {
                    dis[i]=min(dis[u],map[u][i]);
                    if(!b[i]) {
                        q.push(i);
                        b[i]=true;
                    }
                }
            }
        }
        printf("%d
    
    ",dis[n]);
        return;
    }
    int main() {
        int a,b,c,cnt=0;
        read(t);
        while(t--) {
            cnt++;
            read(n);read(m);
            for(int i=1;i<=m;i++) {
                read(a);read(b);read(c);
                map[a][b]=map[b][a]=c;
            }
            printf("Scenario #%d:
    ",cnt);
            spfa();
            for(int i=0;i<=n;i++)
              for(int j=0;j<=n;j++)
                map[i][j]=0;
        }
        return 0;
    }
    View Code


    作者:乌鸦坐飞机
    出处:http://www.cnblogs.com/whistle13326/
    新的风暴已经出现 怎么能够停止不前 穿越时空 竭尽全力 我会来到你身边 微笑面对危险 梦想成真不会遥远 鼓起勇气 坚定向前 奇迹一定会出现

     
  • 相关阅读:
    二十三、DBMS_METADATA(提供提取数据库对象的完整定义的接口)
    二十二、utl_inaddr(用于取得局域网或Internet环境中的主机名和IP地址)
    二十一、utl_file(用于读写OS文件)
    二十、dbms_stats(用于搜集,查看,修改数据库对象的优化统计信息)
    十九、dbms_resource_manager(用于维护资源计划,资源使用组和资源计划指令)
    十八、dbms_repair(用于检测,修复在表和索引上的损坏数据块)
    十七、dbms_tts(检查表空间集合是否是自包含)
    十六、dbms_space_admin(提供了局部管理表空间的功能)
    十五、dbms_space(分析段增长和空间的需求)
    vuex—actions
  • 原文地址:https://www.cnblogs.com/whistle13326/p/6368428.html
Copyright © 2011-2022 走看看