ccf201812-2小明放学

#include<iostream>
using namespace std;
#include<cmath>
typedef long long ll;

ll i=0;
int main(){
	ll r,y,g;
	cin>>r>>y>>g;
	ll n;
	cin>>n;

	
	ll sum=0;
	for(i=0;i<n;i++){  
	ll k,t;
	cin>>k>>t;
		if(k==0){
			sum+=t;
		}
		if(k!=0){
			ll time=sum-t;
			while(1){
			
			if(time<0){
				t=abs(time);
				break;
			}else if(time>0){
				if(k==1){
					//red
					k=3;
					time-=g;
				}
				else if(k==2){
					//yellow
					k=1;
					time-=r;
				}
				else if(k==3){
					//green
					k=2;
					time-=y;
				}
			}
			}
		}
		if(k==1){
			sum+=t;
		}
		if(k==2){
			sum+=t+r;
		}
		if(k==3){
			
		}
	}
	cout<<sum<<endl;
	return 0;
}

不完美,运行超时了,有木有大神指点!!!

蓝瘦香菇。。。

猜你喜欢

转载自blog.csdn.net/a_chen666/article/details/88050900