【Codeforces 760 B Frodo and pillows】+ 二分

最新推荐文章于 2023-02-06 15:29:05 发布

原创

最新推荐文章于 2023-02-06 15:29:05 发布 · 1.4k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#codeforces

博客探讨了在Codeforces的题目中，Frodo如何在有n个hobbits和m个枕头的情况下，确保每个hobbit至少有一个枕头且Frodo自身能获得最大数量的枕头。Frodo睡在第k张床上，解决方案是通过二分法找到最大枕头分配数，使得不造成hobbit间的枕头数量差距超过1。

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

B. Frodo and pillows
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

n hobbits are planning to spend the night at Frodo’s house. Frodo has n beds standing in a row and m pillows (n ≤ m). Each hobbit needs a bed and at least one pillow to sleep, however, everyone wants as many pillows as possible. Of course, it’s not always possible to share pillows equally, but any hobbit gets hurt if he has at least two pillows less than some of his neighbors have.

Frodo will sleep on the k-th bed in the row. What is the maximum number of pillows he can have so that every hobbit has at least one pillow, every pillow is given to some hobbit and no one is hurt?
Input

The only line contain three integers n, m and k (1 ≤ n ≤ m ≤ 109, 1 ≤ k ≤ n) — the number of hobbits, the number of pillows and the number of Frodo’s bed.
Output

Print single integer — the maximum