Submission #2049666


Source Code Expand

Copy
#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class T,size_t n> ostream& operator<<(ostream &os, const array<T,n> &t) {
	os<<"{"; rep(i,n) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T,class U> ostream& operator<<(ostream &os, const tuple<S,T,U> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class S, class T,class U,class V> ostream& operator<<(ostream &os, const tuple<S,T,U,V> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
#else
#define out
#endif
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
const ll MOD=1e9+7;

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
	int h,m,s;
	cin>>h>>m>>s;
	int c1,c2;
	cin>>c1>>c2;
	int b=-1;
	rep(t,MOD){
		// if(t==10) break;
		int H=h,M=m,S=s;
		++S;
		//out(H,M,S,(60*S-60*M-S),(60*s-60*m-s),1);
		// if(fun(60*S-60*M-S,60*s-60*m-s,60*60)){
		if((60*S-60*M-S)*(60*s-60*m-s)<0
			|| 60*s==60*m+s){
			--c1;
			//out(c1,t,1);
		}
		if((60*60*H+60*M+S-60*12*M-12*S)*(60*60*h+60*m+s-60*12*m-12*s)<0
			 || (60*60*h+60*m+s-60*12*m-12*s)==0){
			--c2;
			//out(c2,t,1);
		}
		if(c1==0 && c2==0 && b<0) b=t;
		if(c1<0 || c2<0){
			if(b<0){
				cout<<-1<<endl;
			}else{
				cout<<b+1<<" "<<t<<endl;
			}
			return 0;
		}
		if(S==60){ ++M; S=0;}
		if(M==60){ ++H; M=0;}
		if(H==12) H=0;
		h=H; m=M; s=S;
	}
  return 0;
}

Submission Info

Submission Time
Task A - アナログ時計
User nuip
Language C++14 (GCC 5.4.1)
Score 0
Code Size 3744 Byte
Status WA
Exec Time 5 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 0 / 400
Status
AC × 35
WA × 1
Set Name Test Cases
All _sample_01, _sample_02, _sample_03, _sample_04, corner_01, corner_02, fixed-random-01, fixed-random-02, fixed-random-03, fixed-random-04, fixed-random-05, fixed-random-06, fixed-random-07, fixed-random-08, fixed-random-09, fixed-random-10, large-01, large-02, large-03, large-04, large-05, large-06, large-07, large-08, large-09, large-10, random-01, random-02, random-03, random-04, random-05, random-06, random-07, random-08, random-09, random-10
Case Name Status Exec Time Memory
_sample_01 AC 1 ms 256 KB
_sample_02 AC 1 ms 256 KB
_sample_03 AC 1 ms 256 KB
_sample_04 AC 5 ms 256 KB
corner_01 WA 5 ms 256 KB
corner_02 AC 1 ms 256 KB
fixed-random-01 AC 4 ms 256 KB
fixed-random-02 AC 1 ms 256 KB
fixed-random-03 AC 4 ms 256 KB
fixed-random-04 AC 2 ms 256 KB
fixed-random-05 AC 4 ms 256 KB
fixed-random-06 AC 5 ms 256 KB
fixed-random-07 AC 3 ms 256 KB
fixed-random-08 AC 4 ms 256 KB
fixed-random-09 AC 4 ms 256 KB
fixed-random-10 AC 4 ms 256 KB
large-01 AC 5 ms 256 KB
large-02 AC 5 ms 256 KB
large-03 AC 5 ms 256 KB
large-04 AC 5 ms 256 KB
large-05 AC 5 ms 256 KB
large-06 AC 5 ms 256 KB
large-07 AC 5 ms 256 KB
large-08 AC 5 ms 256 KB
large-09 AC 5 ms 256 KB
large-10 AC 5 ms 256 KB
random-01 AC 3 ms 256 KB
random-02 AC 3 ms 256 KB
random-03 AC 2 ms 256 KB
random-04 AC 4 ms 256 KB
random-05 AC 4 ms 256 KB
random-06 AC 2 ms 256 KB
random-07 AC 4 ms 256 KB
random-08 AC 1 ms 256 KB
random-09 AC 2 ms 256 KB
random-10 AC 2 ms 256 KB