Race Against Time

思路：模擬

AC代碼

#include "iostream"
#include "iomanip"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#pragma comment(linker, "/STACK:102400000,102400000")
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define
 
 mem(a,x) memset(a,x,sizeof(a))
#define step(x) fixed<< setprecision(x)<<
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define ll long long
#define endl ("\n")
#define ft first
#define sd second
#define lrt (rt<<1)
#define rrt (rt<<1|1)
using namespace std;
const
 
 ll mod=1e9+7;
const ll INF = 1e18+1LL;
const int inf = 1e9+1e8;
const double PI=acos(-1.0);
const int N=1e5+100;

double hh,mm,ss,t1,t2;
int main(){
    cin>>hh>>mm>>ss>>t1>>t2;
    int f=0;
    if(t2<t1) swap(t1,t2);
    hh+=mm/60+ss/(60*60), mm+=ss/60;
    hh*=5, t1*=5, t2*=5
 
;
    if(hh>=60) hh-=60;
    if(mm>=60) mm-=60;
    if(hh>=t1 && hh<=t2 && ss>=t1 && ss<=t2 && mm>=t1 && mm<=t2){
        cout<<"YES\n";
        return 0;
    }
    if(((mm>=t2 && mm<=60) || (mm>=0 && mm<=t1))&&((hh>=t2 && hh<=60) || (hh>=0 && hh<=t1)) && ((ss>=t2 && ss<=60) || (ss>=0 && ss<=t1)) ){
        cout<<"YES\n";
        return 0;
    }
    //cout<<hh<<" "<<mm<<" "<<ss<<" "<<t1<<" "<<t2<<endl;
    cout<<"NO\n";
    return 0;
}

Codeforces Round #438 B