Canadian Coding Competition(CCC) 2020 Senior 题解

最新推荐文章于 2025-12-06 19:00:36 发布

原创

最新推荐文章于 2025-12-06 19:00:36 发布 · 1k 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #学习 #开发语言 #经验分享

文章包含一系列编程问题，涉及推测短跑运动员的最高速度、在给定房间内逃脱的可能性、寻找字符串的特定排列子串以及计算在队列中最后一个人拿到心仪汉堡的概率。这些问题都需要运用算法和数据结构来解决。

Problem S1: Surmising a Sprinter’s Speed

Problem S1: 推测短跑运动员的速度

Problem Description

Trick E. Dingo is trying, as usual, to catch his nemesis the Street Sprinter. His past attempts using magnets, traps and explosives have failed miserably, so he’s catching his breath to gather observational data and learn more about how fast Street Sprinter is. Trick E. Dingo and Street Sprinter both inhabit a single straight west-east road with a particularly famous rock on it known affectionately as The Origin. Positions on this straight road are measured numerically according to the distance from The Origin, and using negative numbers for positions west of The Origin and positive numbers for positions east of The Origin. The observations by Trick E. Dingo each contain two numbers: a time, and the value of Street Sprinter’s position on the road at that time. Given this information, what speed must Street Sprinter must be capable of?

Input Specification

The first line contains a number 2 ≤ N ≤ 100 000, the number of observations that follow. The next N lines each contain an integer 0 ≤ T ≤ 1 000 000 000 indicating the time, in seconds, of when a measurement was made, and an integer −1 000 000 000 ≤ X ≤ 1 000 000 000 indicating the position, in metres, of the Street Sprinter at that time. No two lines will have the same value of T. For 7 of the 15 available marks, N ≤ 1000.

Output Specification

Output a single number X, such that we can conclude that Street Sprinter’s speed was at least X metres/second at some point in time, and such that X is as large as possible. If the correct answer is C, the grader will view X as correct if |X − C|/C < 10−5 .

Sample Input 1

0 100

20 50

10 120

Output for Sample Input 1

7.0

Explanation of Output for Sample Input 1

Since the Street Sprinter ran from position 100 to position 120 between time 0 and time 10, we know its speed must have been at least 2 at some point in time: if it was always less than 2, then the distance of 20 could not be covered in 10 seconds. Likewise, the speed must have been at least 7 in order to travel between position 120 and 50 in 10 seconds.