Submission #915452

---

Source Code Expand

#include <iostream>
#include <vector>
#include <iomanip>
#include <algorithm>
using namespace std;

class tms{
public:
    int sh,sm;
    int eh,em;
    bool view_flag = true;

    tms(int sh1,int sm1,int eh1,int em1){
        sh = sh1;eh = eh1;
        //23 -> 20
        //28 -> 25
        sm = ((sm1%10)/5)*5+sm1/10*10;
        int t = (em1%10 + 4)/5*5;
        em = em1/10*10 + t;
        
        if(em == 60){
            eh++;
            em = 0;
        }
    }
    
    tms(){
    }
    
    void view(){
        //cout << setfill('0') << setw(2) << sh << ":" << sm << "-" << eh << ":" << em << endl;
        if(view_flag)
        printf("%02d%02d-%02d%02d\n",sh,sm,eh,em);
        
    }
};

#include <string>

int main(void){
    // Here your code !
    int n;
    cin >> n;
    
    vector<tms> times(n);
    
    for(int i = 0; i < n; i++){
        string s;
        cin >> s;
        times[i] = tms(
        atoi(s.substr(0,4).c_str()) / 100,
        atoi(s.substr(0,4).c_str()) % 100,
        atoi(s.substr(5,9).c_str()) / 100,
        atoi(s.substr(5,9).c_str()) % 100
        );
    }
    
    sort(times.begin(),times.end(),[](tms a,tms b){
        return (a.eh == b.eh) ? (a.em < b.em)  : (a.eh < b.eh); 
    });
    
    for(int i = 0; i < n ;i ++){
        for(int j = i+1; j < n; j++){
            if(times[i].eh > times[j].sh ||
                (times[i].eh == times[j].sh && times[i].em >= times[j].sm)
                ){
                times[i].view_flag = false;
                
                if(times[i].sh < times[j].sh || (
                    times[i].sh == times[j].sh && times[i].sm < times[j].sm
                    ) ){
                    times[j].sh = times[i].sh;
                    times[j].sm = times[i].sm;
                    }
            }
        }
    }
    
    for(int i = 0; i < n; i++)
        times[i].view();
    
    
}

Submission Info

Judge Result