Submission #834805

---

Source Code Expand

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

using namespace std;

int main(){

    int N;
    cin>> N;
    int S[N], E[N];
    for(int i=0; i<N; i++){
        string str;
        cin>> str;
        S[i]=stoi(str.substr(0, 4));
        E[i]=stoi(str.substr(5, 4));
    }

    for(int i=0; i<N; i++){
        S[i]=S[i]/100*60+S[i]%100;
        E[i]=E[i]/100*60+E[i]%100;
        S[i]-=S[i]%5;
        E[i]+=(10-E[i]%5)%5;
    }

    vector<pair<int, int> > data;
    for(int i=0; i<N; i++){
        data.push_back(make_pair(S[i], E[i]));
    }
    sort(data.begin(), data.end());
    data.push_back(make_pair(25*60, 25*60));

    int f=data[0].first, t=data[0].second;
    for(int i=0; i<N; i++){
        if(t<data[i+1].first){
            f=f/60*100+f-f/60*60;
            t=t/60*100+t-t/60*60;
            printf("%04d-%04d\n", f, t);
            f=data[i+1].first;
            t=data[i+1].second;
        }else{
            t=max(t, data[i+1].second);
        }
    }

    return 0;
}

Submission Info

Judge Result