Submission #260174

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>

using namespace std;

vector<pair<string, string> > prepare(vector<string> &memo){
   vector<pair<string, string> > times;

    for(int i = 0; i < memo.size(); i++){
        string s = memo[i];
        string minute1 = s.substr(2,2), hour1 = s.substr(0,2),
            minute2 = s.substr(7,2), hour2 = s.substr(5,2);

        if(!(minute1[1] == '0' || minute1[1] == '5')){
             minute1[1] = minute1[1] < '5' ? '0' : '5';
        }

        if(!(minute2[1] == '0' || minute2[1] == '5')){
            minute2[1]= minute2[1] < '5' ? '5' : '0';
            minute2[0] = minute2[1] == '0' ? minute2[0] + 1 :minute2[0];
            if(minute2[0] >= '6'){
                minute2[0] -= 6;
                hour2[1] += 1;
                if (hour2[1] == '9'+1) {
                    hour2[0]++;
                    hour2[1] = '0';
                }
            }
        }

        times.push_back(make_pair(hour1 + minute1, hour2 + minute2));
    }

    return times;
}

int main(int argc, char* argv[]) {
    int N;
    cin>>N;

    vector<string> memo;
    for(int i = 0; i < N; i++){
        string s;
        cin>>s;
        memo.push_back(s);
    }

    vector<pair<string,string > > times = prepare(memo);
    sort(times.begin(), times.end());

    string start = "", end;
    for(int i = 0; i < times.size(); i++){
        if(start == ""){
            start = times[i].first;
            end = times[i].second;
            continue;
        }
        else{
            if(times[i].first <= end){
                end = max(end, times[i].second);
            }
            else{
                cout<<start<<"-"<<end<<endl;
                start = times[i].first;
                end = times[i].second;
            }
        }
    }

    cout<<start<<"-"<<end<<endl;

    return 0;
}

Submission Info

Judge Result