Submission #2049760

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <cctype>
#include <complex>
using namespace std;

#define INF_LL (ll)1e18
#define INF (int)1e9
#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using ll = long long;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;

const double eps = 1e-10;

template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}

int main(void){
	cin.tie(0);
	ios::sync_with_stdio(false);

	int H, M, S;
	int c1,c2;
	cin >> H >> M >> S;
	cin >> c1 >> c2;
	ll r1 = 0, r2 = 0;
	int cnt1 = 0, cnt2 = 0;
	H%=12;
	while(cnt1 < c1 || cnt2 < c2){
		r1++;
		bool ok1 = 0, ok2 = 0, ok3 = 0, ok4 = 0;
		ok1 = (3600*30*H + 30*60*M+30*S > 3600*6*M+360*S);
		ok3 = (60*S < 60*M+S);
		S++;
		M+=S/60;
		S%=60;
		H+=M/60;
		M%=60;
		ok4 = (60*S >= 60*M+S);
		if(ok3 && ok4)
			cnt1++;
		H%=12;
		ok2 = (3600*30*H + 30*60*M+30*S <= 3600*6*M+360*S);
		if((ok1 && ok2) || (H==0 && M == 0 && S == 0)){
			cnt2++;
		}
	}
	if(H+M+S == 0){
		r1++;
		S++;
	}
	if(cnt1 != c1 || cnt2 != c2){
		cout << -1 << endl;
		return 0;
	}
	r2 = r1;
	while(cnt1 == c1 && cnt2 == c2){
		S++;
		r2++;
		if(S > M && (S-1) <= M)
			cnt1++;
		M+=S/60;
		S%=60;
		if(M*60+(S+60-1)%60 > 60*((S+60-1)%60) && M*60+S <= 60*S)
			cnt2++;
		H+=M/60;
		M%=60;
		H%=12;
	}
	cout << r1 << " " << r2-1 << endl;
}

Submission Info

Judge Result