zoukankan      html  css  js  c++  java
  • UVa10048_Audiophobia(最短路/floyd)(小白书图论专题)

    解题报告

    题意:

    求全部路中最大分贝最小的路。

    思路:

    类似floyd算法的思想。u->v能够有另外一点k。通过u->k->v来走,拿u->k和k->v的最大值和u->v比較。存下最小的值。

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <cmath>
    #define inf 0x3f3f3f3f
    using namespace std;
    int n,m,q,mmap[110][110];
    void floyd() {
        for(int k=0; k<n; k++)
            for(int i=0; i<n; i++)
                for(int j=0; j<n; j++)
                    mmap[i][j]=min(mmap[i][j],max(mmap[i][k],mmap[k][j]));
    }
    int main() {
        int i,j,u,v,w,k=1;
        while(~scanf("%d%d%d",&n,&m,&q)) {
            if(!n&&!m&&!q)break;
            for(i=0; i<n; i++) {
                for(j=0; j<n; j++)
                    mmap[i][j]=inf;
                mmap[i][i]=0;
            }
            for(i=0; i<m; i++) {
                scanf("%d%d%d",&u,&v,&w);
                mmap[u-1][v-1]=mmap[v-1][u-1]=w;
            }
            floyd();
            if(k!=1)
                printf("
    ");
            printf("Case #%d
    ",k++);
            while(q--) {
                scanf("%d%d",&u,&v);
                if(mmap[u-1][v-1]==inf)
                    printf("no path
    ");
                else
                    printf("%d
    ",mmap[u-1][v-1]);
            }
        }
        return 0;
    }
    

     Problem B: Audiophobia 

    Consider yourself lucky! Consider yourself lucky to be still breathing and having fun participating in this contest. But we apprehend that many of your descendants may not have this luxury. For, as you know, we are the dwellers of one of the most polluted cities on earth. Pollution is everywhere, both in the environment and in society and our lack of consciousness is simply aggravating the situation.

    However, for the time being, we will consider only one type of pollution ­- the sound pollution. The loudness or intensity level of sound is usually measured in decibels and sound having intensity level 130 decibels or higher is considered painful. The intensity level of normal conversation is 60­65 decibels and that of heavy traffic is 70­80 decibels.

    Consider the following city map where the edges refer to streets and the nodes refer to crossings. The integer on each edge is the average intensity level of sound (in decibels) in the corresponding street.

    To get from crossing A to crossing G you may follow the following path: A­C­F­G. In that case you must be capable of tolerating sound intensity as high as 140 decibels. For the paths A­B­E­GA­B­D­G and A­C­F­D­G you must tolerate respectively 90, 120 and 80 decibels of sound intensity. There are other paths, too. However, it is clear that A­C­F­D­G is the most comfortable path since it does not demand you to tolerate more than 80 decibels.

    In this problem, given a city map you are required to determine the minimum sound intensity level you must be able to tolerate in order to get from a given crossing to another.

    Input 

    The input may contain multiple test cases.

    The first line of each test case contains three integers $C (le 100)$$S (le1000)$ and $Q (le 10000)$ where Cindicates the number of crossings (crossings are numbered using distinct integers ranging from 1 to C), Srepresents the number of streets and Q is the number of queries.

    Each of the next S lines contains three integers: c1c2 and d indicating that the average sound intensity level on the street connecting the crossings c1 and c2 ( $c_1 
e c_2$) is d decibels.

    Each of the next Q lines contains two integers c1 and c2 ( $c_1 
e c_2$) asking for the minimum sound intensity level you must be able to tolerate in order to get from crossing c1 to crossing c2.

    The input will terminate with three zeros form CS and Q.

    Output 

    For each test case in the input first output the test case number (starting from 1) as shown in the sample output. Then for each query in the input print a line giving the minimum sound intensity level (in decibels) you must be able to tolerate in order to get from the first to the second crossing in the query. If there exists no path between them just print the line ``no path".

    Print a blank line between two consecutive test cases.

    Sample Input 

    7 9 3
    1 2 50
    1 3 60
    2 4 120
    2 5 90
    3 6 50
    4 6 80
    4 7 70
    5 7 40
    6 7 140
    1 7
    2 6
    6 2
    7 6 3
    1 2 50
    1 3 60
    2 4 120
    3 6 50
    4 6 80
    5 7 40
    7 5
    1 7
    2 4
    0 0 0
    

    Sample Output 

    Case #1
    80
    60
    60
     
    Case #2
    40
    no path
    80
    



    Miguel Revilla 
    2000-12-26


  • 相关阅读:
    记账程序2.0
    安装redHat6.5详细图文教程
    redHat6设置ip地址
    如何开通B站的直播空间
    python实战技巧之两个字典,如何实现键同则值相加【不等长或等长】
    python实战技巧之去除列表中的空值元素
    python实战技巧之两个不等长列表让里面的数字一一对应地相加
    python实战技巧之两个列表实例中,如何让里面的数字一一对应地相加【对于两个列表是等长的情况】
    java基础_网络编程
    java基础_String
  • 原文地址:https://www.cnblogs.com/lytwajue/p/6902471.html
Copyright © 2011-2022 走看看