CSP 201812-2 小明放学

EMMMM

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
  int r, y, g;
  cin >> r >> y >> g;
  ll cur_time = 0;
  int mod = (r + y + g);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int k, t;
    cin >> k >> t;
    if (k == 0) {
      cur_time += t;
    } else if (k == 1) {
      int wait_time = cur_time % mod;
      if (wait_time >= t && wait_time <= t + g) {
        continue;
      } else if (wait_time > t + g) {
        cur_time += mod - wait_time + t;
      } else {
        cur_time += t - wait_time;
      }
    } else if (k == 2) {
      int wait_time = cur_time % mod;
      if (wait_time >= t + r && wait_time <= t + g + r) {
        continue;
      } else if (wait_time > t + g + r) {
        cur_time += mod - wait_time + t + r;
      } else {
        cur_time += t + r - wait_time;
      }
    } else {
      int wait_time = cur_time % mod;
      if (wait_time <= t || wait_time >= t + y + r) {
        continue;
      } else if (wait_time > t && wait_time < t + y + r) {
        cur_time += t + y + r - wait_time;
      }
    }
  }
  cout << cur_time;
}