CSP 2018-12-2 小明放学

#include <iostream>

using namespace std;

long long res = 0,t;
int r, y, g, n, k;
int time = 0;
int ahead = 0;
int main()
{
	cin >> r >> y >> g;
	cin >> n;
	while (n) 
	{   
		cin >> k >> t;
		time = r + g + y;
		
		ahead = res % time;
		if (k==0) 
			{
				res += t;
			}
		else if (k == 1) {
			if (ahead < t) {
				res += t - ahead;
			}
			else if (ahead >= t && (ahead < t + g)) {
				;
			}
			else if (ahead >= t + g && ahead < t + g + y) {
				res += t + g + y - ahead + r;
			}
			else if (ahead >= t + g + y && ahead < r + g + y) {
				res += r + g + y + t - ahead;
			}
		}
		else if (k == 2) {
			if (ahead < t) {
				res += t - ahead + r;
			}
			else if (ahead >= t && ahead < t + r) {
				res += t + r - ahead;
			}
			else if (ahead >= t + r && ahead < t + r + g) {
				;
			}
			else if (ahead >= t + r + g && ahead < r + g + y) {
				res += r + g + y + t - ahead + r;
			}
		}
		else if(k==3)
			{
					if (ahead < t) {
						;
					}
					else if (ahead >= t && ahead < t + y) {
						res += t + y - ahead + r;
					}
					else if (ahead >= t + y && ahead < t + r + y) {
						res += t + r + y - ahead;
					}
					else if (ahead >= t + r + y && ahead < r + g + y) {
						;
					}
			}
		n--;
	}
	cout << res;
	return 0;
}