C. Stairs and Elevators 二分查找

最新推荐文章于 2020-11-21 12:37:01 发布

哒哒哒哒哒嘭

最新推荐文章于 2020-11-21 12:37:01 发布

阅读量488

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM

本文链接：https://blog.youkuaiyun.com/Bug___Maker/article/details/80151119

该博客讨论了在一个有楼梯和电梯的多层酒店建筑中，如何通过二分查找算法来快速找到从一个房间到另一个房间的最短路径。文章介绍了如何处理查询并计算在不同楼层间移动的最短时间，考虑了电梯的最大速度和楼梯的移动效率。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

C. Stairs and Elevators

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

In the year of $30 X X$ participants of some world programming championship live in a single large hotel. The hotel has $n$ floors. Each floor has $m$ sections with a single corridor connecting all of them. The sections are enumerated from $1$ to $m$ along the corridor, and all sections with equal numbers on different floors are located exactly one above the other. Thus, the hotel can be represented as a rectangle of height $n$ and width $m$ . We can denote sections with pairs of integers $(i, j)$ , where $i$ is the floor, and $j$ is the section number on the floor.

The guests can walk along the corridor on each floor, use stairs and elevators. Each stairs or elevator occupies all sections $(1, x)$ , $(2, x)$ , $\dots$ , $(n, x)$