Start: Jun, 28, 2019 13:00:00
2019年度暑期短学期第四天-助教场
End: Jun, 30, 2019 23:59:00
Time elapsed:
Time remaining:

Problem_ID: C
Result: Accepted
Time: 3ms
Memory: 2540kB
Author: 2018212212317
In contest: 1289


#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
const int maxn = 100010;
const int inf = 0x3f3f3f3f;
const int modu = 1e9+7;
int n,m,k,t,sum,sum1,ans,cnt;
int x,y,z,w;
int a[maxn],b[maxn];
string s;
int main(){
	cin>>t;
	while(t--){
		sum=0;
		ans=0;
		cin>>x>>y;
		cin>>z>>w;
		cin>>s;
		sum+=(s[0]-'0')*600+(s[1]-'0')*60+(s[3]-'0')*10+s[4]-'0';
		sum-=300;
		sum1=sum+y;
		if(sum1>1139) sum1=1139;
		if(sum<w) ans=(sum+y)/z;
		else{
			if((sum1)%z==0) ans=(sum1)/z;
			else ans=(sum1)/z+1;
			if(w<z){
				if(sum%z>=w) {
					cnt=sum/z+1;
					//cout<<cnt<<" 1"<<endl;
				}
				else {
					cnt=sum/z;
					//cout<<cnt<<" 2"<<endl;
				}
			}
			else {
				cnt=(sum-(w-z))/z;
				//cout<<cnt<<" 3"<<endl;
			}
			ans-=cnt;
		}
		cout<<ans<<endl;
	}
}