Submission #951659

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
typedef pair<int,int> P;

string conver(int N){
    string ret;
    if(N/100<10){
        if(N/100==0){
            if(N/10==0){
                ret = "000"+to_string(N);
            }else{
                ret = "00"+to_string(N);
            }
        }else{
            ret="0"+to_string(N);
        }
    }else{
        ret = to_string(N);
    }
    return ret;
}

int main(){
    int N;
    P data[30000];
    cin>>N;
    for(int i=0;i<N;i++){
        cin>>data[i].first>>data[i].second;
        data[i].second=-data[i].second;
        data[i].first = data[i].first - data[i].first%5;
        data[i].second = data[i].second + ((5-(data[i].second%5))%5);
        if(data[i].second%100==60){
            data[i].second+=40;
        }
    }
    sort(data,data+N);
    int grp=0;
    int start_ans[30000],end_ans[30000];
    start_ans[grp]=data[0].first;
    end_ans[0]=data[0].second;
    for(int i=1;i<N;i++){
        if(data[i].first<=end_ans[grp]){
            end_ans[grp]=max(end_ans[grp],data[i].second);
        }else{
            grp++;
            start_ans[grp]=data[i].first;
            end_ans[grp]=data[i].second;
        }
    }
    for(int i=0;i<=grp;i++){
        cout << conver(start_ans[i]) << '-' << conver(end_ans[i]) << endl;
    }
    
    
    
    return 0;
}

Submission Info

Judge Result