CSP201812-2 小明放学

最新推荐文章于 2023-12-06 16:53:01 发布

萌妹在线写报告

最新推荐文章于 2023-12-06 16:53:01 发布

阅读量202

点赞数

本文链接：https://blog.csdn.net/weixin_43918760/article/details/100737299

版权

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cstdlib>

#define int long long
using namespace std;
const int MAXN = 1e5+7;

int tim[5];
int sum[5];
int n;

int cal(int pre, int t, int x){
    int now = (sum[x] - t + pre) % sum[3];
    if(now >= sum[2]) return 0;
    return sum[2] - now;
}

int main(){
    cin >> tim[2] >> tim[1] >> tim[3];
    for(int i = 1; i <= 3; i++)
        sum[i] = sum[i-1] + tim[i];
    cin >> n;
    int ans = 0;
    for(int i = 0; i < n; i++){
        int x, t, ad = 0;
        cin >> x >> t;
        if(x == 0)
           ad = t;
        else{
            if(x <= 2) x = 3 - x;
            ad = cal(ans, t, x);
        }
        ans += ad;
        //printf("## %lld %lld\n", ad, ans);
    }
    cout << ans << endl;
}