注册 登录  
 加关注
查看详情
   显示下一条  |  关闭
温馨提示!由于新浪微博认证机制调整,您的新浪微博帐号绑定已过期,请重新绑定!立即重新绑定新浪微博》  |  关闭

Minary_Acdream

http://f10.moe/

 
 
 

日志

 
 

UVa 10048 Audiophobia  

2012-07-05 14:40:04|  分类: uva |  标签: |举报 |字号 订阅

  下载LOFTER 我的照片书  |
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.

UVa 10048  Audiophobia - Minary - Minary_Acdream

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 (\le 1000)$ and $Q (\le 10000)$ where C indicates the number of crossings (crossings are numbered using distinct integers ranging from 1 to C), S represents 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 \ne c_2$) is d decibels.

Each of the next Q lines contains two integers c1 and c2 ( $c_1 \ne 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 



很简单的思路,和上次热身赛的货币转换那一题差不多(http://minary.blog.163.com/blog/static/20871416820125309308124/)
但是一直超时,后来才发现,原来把这个算法写到了循环里面去= =就一直超时了。感谢 * * 帮我指出来。

下面就是代码了:

#include<iostream>
#include<stdio.h>
using namespace std;

int C,S,Q;
int map[101][101];
int N = 1;
const int MAX = 1000000;


void flody()
{
for(int k = 1; k <= C ; ++k)
{
for(int i = 1; i <= C; ++i)
{
for(int j = i + 1; j <= C; ++j)
{
int a = min(map[i][k], map[k][i]);
int b = min(map[k][j], map[j][k]);
map[i][j] = min(map[i][j], max(a, b));
}
}
}

}

int main()
{
while(~scanf("%d %d %d",&C,&S,&Q))
{
if(C == 0 && S == 0 && Q == 0) break;
if(N != 1) printf("\n");
for(int i = 1;i <= C;i++)
{
for(int j = 1;j <= C;j ++)
{
map[i][j] = MAX;
}
}

for(int i = 1;i <= C;i ++)
{
map[i][i] = 0;
}
for(int i = 0;i < S;i ++)
{
int s,e,sound;
scanf("%d %d %d", &s, &e, &sound);
map[s][e] = map[e][s] = sound;
}
cout<<"Case #"<<N++<<endl;
flody();
for(int i = 0;i < Q;i ++)
{
int s,e;
scanf("%d %d", &s, &e);
if(s > e)
{
int m = s;
s = e;
e = m;

}
if(map[s][e] == MAX)
{
printf("no path\n");
}
else
{
printf("%d\n", map[s][e]);
}

}

}
}



  评论这张
 
阅读(359)| 评论(0)
推荐 转载

历史上的今天

在LOFTER的更多文章

评论

<#--最新日志,群博日志--> <#--推荐日志--> <#--引用记录--> <#--博主推荐--> <#--随机阅读--> <#--首页推荐--> <#--历史上的今天--> <#--被推荐日志--> <#--上一篇,下一篇--> <#-- 热度 --> <#-- 网易新闻广告 --> <#--右边模块结构--> <#--评论模块结构--> <#--引用模块结构--> <#--博主发起的投票-->
 
 
 
 
 
 
 
 
 
 
 
 
 
 

页脚

网易公司版权所有 ©1997-2018