Difference between revisions of "2019 Multi-University,HDU Day 1"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) (Created page with "== Problem A == Unsolved. == Problem B == Unsolved. (-1) == Problem C == Unsolved. == Problem D == Solved by Xiejiadong. 01:55:24 (+) == Problem E == Solved by Kilo_5...") |
Xiejiadong (talk | contribs) |
||
| Line 14: | Line 14: | ||
Solved by Xiejiadong. 01:55:24 (+) | Solved by Xiejiadong. 01:55:24 (+) | ||
| + | |||
| + | 题意：给出每个小车距离终点的距离、车的长度和车的最快速度。求最后一辆车头到达终点的最少时间。要求本来排在后面的车不能冲到前面去。 | ||
| + | |||
| + | 题解：二分答案。考虑在时间 $mid$ 的时候，车最多能到达的地方。 | ||
| + | |||
| + | 显然第一辆车全速开，如果后面的车在时间 $mid$ 的时候冲到了前面的车的后面，说明在某个时刻这辆车已经追上了前车，那么这辆车肯定和前辆车连续排布。 | ||
| + | |||
| + | 如此考虑最后一辆车是否超过了终点即可。 | ||
== Problem E == | == Problem E == | ||
Revision as of 11:45, 22 July 2019
Problem A
Unsolved.
Problem B
Unsolved. (-1)
Problem C
Unsolved.
Problem D
Solved by Xiejiadong. 01:55:24 (+)
题意：给出每个小车距离终点的距离、车的长度和车的最快速度。求最后一辆车头到达终点的最少时间。要求本来排在后面的车不能冲到前面去。
题解：二分答案。考虑在时间 $mid$ 的时候，车最多能到达的地方。
显然第一辆车全速开，如果后面的车在时间 $mid$ 的时候冲到了前面的车的后面，说明在某个时刻这辆车已经追上了前车，那么这辆车肯定和前辆车连续排布。
如此考虑最后一辆车是否超过了终点即可。
Problem E
Solved by Kilo_5723. 01:45:39 (+1)
Problem F
Unsolved. (-1)
Problem G
Unsolved.
Problem H
Solved by Xiejiadong. 04:15:04 (+1)
Problem I
Unsolved.
Problem J
Unsolved.
Problem K
Unsolved.
Problem L
Unsolved.
Problem M
Unsolved. (-19)