【Codeforces 746D Green and Black Tea】+ 构造

最新推荐文章于 2021-10-05 14:37:41 发布

楚江枫

最新推荐文章于 2021-10-05 14:37:41 发布

阅读量874

点赞数

分类专栏：构造文章标签： codeforces

本文链接：https://blog.csdn.net/WYK1823376647/article/details/53731029

版权

该博客介绍了Codeforces 746D问题，内容涉及如何安排绿色和黑色茶包的顺序，使得在不超过k次连续相同茶的情况下，饮完n杯茶。提供了输入输出示例，并给出了解决方案的关键思路，即先填充最多的茶包类型，然后逐步插入另一种茶包。

摘要由CSDN通过智能技术生成

D. Green and Black Tea
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Innokentiy likes tea very much and today he wants to drink exactly n cups of tea. He would be happy to drink more but he had exactly n tea bags, a of them are green and b are black.

Innokentiy doesn’t like to drink the same tea (green or black) more than k times in a row. Your task is to determine the order of brewing tea bags so that Innokentiy will be able to drink n cups of tea, without drinking the same tea more than k times in a row, or to inform that it is impossible. Each tea bag has to be used exactly once.
Input

The first line contains four integers n, k, a and b (1 ≤ k ≤ n ≤ 105, 0 ≤ a, b ≤ n) — the number of cups of tea Innokentiy wants to drink, the maximum number of cups of same tea he can drink in a row, the number of tea bags of green and black tea. It