CodeForces - 10A_模拟_codeforces 10a-优快云博客

本文链接：https://blog.youkuaiyun.com/hesorchen/article/details/105652638

本文探讨了一台电脑在不同工作状态下的能耗问题，通过分析三种模式下的功率消耗，提出了一个计算总能耗的算法。该算法考虑了正常模式、屏幕保护模式和睡眠模式的切换，以及用户在各模式间的交互行为。

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

Tom is interested in power consumption of his favourite laptop. His laptop has three modes. In normal mode laptop consumes P1 watt per minute. T1 minutes after Tom moved the mouse or touched the keyboard for the last time, a screensaver starts and power consumption changes to P2 watt per minute. Finally, after T2 minutes from the start of the screensaver, laptop switches to the “sleep” mode and consumes P3 watt per minute. If Tom moves the mouse or touches the keyboard when the laptop is in the second or in the third mode, it switches to the first (normal) mode. Tom’s work with the laptop can be divided into n time periods [l1, r1], [l2, r2], …, [ln, rn]. During each interval Tom continuously moves the mouse and presses buttons on the keyboard. Between the periods Tom stays away from the laptop. Find out the total amount of power consumed by the laptop during the period [l1, rn].
Input
The first line contains 6 integer numbers n, P1, P2, P3, T1, T2 (1 ≤ n ≤ 100, 0 ≤ P1, P2, P3 ≤ 100, 1 ≤ T1, T2 ≤ 60). The following n lines contain description of Tom’s work. Each i-th of these lines contains two space-separated integers li and ri (0 ≤ li < ri ≤ 1440, ri < li + 1 for i < n), which stand for the start and the end of the i-th period of work.
Output

Output the answer to the problem.

Examples
Input

1 3 2 1 5 10
0 10

Output

Input

2 8 4 2 5 10
20 30
50 100

Output

题目大意：一台电脑有三种工作状态，每个工作状态有不同的耗电功率，求耗电值。

这题挺考察分类细节的，一个地方错了就过不了。

inline int f(int x, int l, int r)
{
    return x * (r - l);
}
int main()
{
    int n, p1, p2, p3, t1, t2;
    cin >> n >> p1 >> p2 >> p3 >> t1 >> t2;
    int ans = 0;
    int last = -1;
    while (n--)
    {
        int a, b;
        cin >> a >> b;
        ans += f(p1, a, b);
        if (last != -1)
            if (a - last <= t1)
            {
                ans += f(p1, last, a);
            }
            else
            {
                ans += f(p1, last, last + t1);
                if (a - last - t1 <= t2)
                {
                    ans += f(p2, last + t1, a);
                }
                else
                {
                    ans += f(p2, last + t1, last + t1 + t2);
                    ans += f(p3, last + t1 + t2, a);
                }
            }
        last = b;
    }
    cout << ans << endl;
    return 0;
}