两个吃奶一个添下面视频_人妻第一页香蕉网_欧美xxxx少妇_妺妺窝人体色www婷婷

1078 問(wèn)題 G: Repairing a Road

時(shí)間限制: 1s 內(nèi)存限制: 128MB 提交: 479 解決: 270
題目描述
You live in a small town with R bidirectional roads connecting C crossings and you want to go from crossing 1 to crossing C as soon as possible. You can visit other crossings before arriving at crossing C, but it’s not mandatory.

You have exactly one chance to ask your friend to repair exactly one existing road, from the time you leave crossing 1. If he repairs the i-th road for t units of time, the crossing time after that would be viai-t. It's not difficult to see that it takes vi units of time to cross that road if your friend doesn’t repair it.

You cannot start to cross the road when your friend is repairing it.
輸入

 There will be at most 25 test cases. Each test case begins with two integers C and R (2<=C<=100, 1<=R<=500). Each of the next R lines contains two integers xiyi (1<=xiyi<=C) and two positive floating-point numbers vi and ai (1<=vi<=20,1<=ai<=5), indicating that there is a bidirectional road connecting crossing xi and yi, with parameters vi and ai (see above). Each pair of crossings can be connected by at most one road. The input is terminated by a test case with C=R=0, you should not process it.

輸出

 For each test case, print the smallest time it takes to reach crossing C from crossing 1rounded to digitsafter decimal point. It’s always possible to reach crossing C from crossing 1.

樣例輸入
3 2
1 2 1.5 1.8
2 3 2.0 1.5
2 1
1 2 2.0 1.8
0 0
樣例輸出
2.589
1.976
提示
零基礎(chǔ)同學(xué)可以先學(xué)習(xí)視頻課程,包含C/C++、Python、百練、藍(lán)橋杯輔導(dǎo)、算法數(shù)據(jù)結(jié)構(gòu)等課程,提供視頻講解以及配套習(xí)題,還有老師答疑,點(diǎn)擊這里了解課程詳情

比賽公告

Tips:
請(qǐng)對(duì)本次比賽進(jìn)行一些描述,公告內(nèi)容應(yīng)當(dāng)包含:
比賽的創(chuàng)辦者或組織;
本次比賽的目的或意義;
本次比賽的考點(diǎn)、語(yǔ)言或類型;或其他注意事項(xiàng)及描述等。
至少保證30個(gè)漢字長(zhǎng)度。