Victor and Machine----（BestCoder Round #52 (div.2)）

最新推荐文章于 2017-12-18 11:26:25 发布

原创最新推荐文章于 2017-12-18 11:26:25 发布 · 528 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

BestCoder 专栏收录该内容

14 篇文章

订阅专栏

本文探讨了Victor使用带有特定故障的机器弹出球的模式，并提出了一个算法来计算第n个球被弹出的时间。通过输入机器关闭和重启的周期，以及机器启动后的等待时间和球的弹出间隔，算法能够精确计算出第n次球弹出的时间。

Victor and Machine

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 131072/65536 K (Java/Others)

Victor has a machine. When the machine starts up, it will pop out a ball immediately. After that, the machine will pop out a ball every $w$ seconds. However, the machine has some flaws, every time after $x$ seconds of process the machine has to turn off for $y$ seconds for maintenance work. At the second the machine will be shut down, it may pop out a ball. And while it's off, the machine will pop out no ball before the machine restart.

Now, at the $0$ second, the machine opens for the first time. Victor wants to know when the $n$ -th ball will be popped out. Could you tell him?

分析：直接模拟就行，最好把第一次开启时排除，然后捆绑先关闭和后开启。这样算起来方便些。

很遗憾，这次没在状态，只完成了一题。掉分了，还有codeforces也掉了，呜呜··

CODE：

#include <iostream>
using namespace std;

int main()
{
    long long x,y,w,n;
    while(cin>>x>>y>>w>>n){
        long long t=x/w+1;
        long long tim;
        if(n%t==0){
            tim=(n/t-1)*(x+y)+(t-1)*w;
        }
        else{
            tim=(n/t)*(x+y)+(n%t-1)*w;
        }
        cout<<tim<<endl;
    }
    return 0;
}