Submission #834810

---

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;
    }

    int li[24*60+2];
    fill(li, li+24*60+2, 0);
    for(int i=0; i<N; i++){
        li[S[i]]++;
        li[E[i]+1]--;
    }
    for(int t=1; t<24*60+2; t++){
        li[t]+=li[t-1];
    }
    int f=0, to=0;
    for(int t=0; t<=24*60; t++){
        if(li[t]!=0){
            f=t;
            break;
        }
    }
    int r=0;
    for(int t=f; t<=24*60; t++){
        if(li[t]>0){
            if(r==0){
                f=t;
                r=1;
            }else{
                to=t;
            }
        }else{
            if(r==0) continue;
            f=f/60*100+f-f/60*60;
            to=to/60*100+to-to/60*60;
            printf("%04d-%04d\n", f, to);
            //f=to=t-1;
            r=0;
        }
    }
    if(r==1){
        f=f/60*100+f-f/60*60;
        to=to/60*100+to-to/60*60;
        printf("%04d-%04d\n", f, to);
    }
    return 0;
}

Submission Info

Judge Result