Submission #903156

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
using P = pair<int, int>;

int main() {
    int N;
    cin >> N;
    vector<P> v(N);
    for(int i=0; i<N; ++i) {
        string s;
        cin >> s;
        int pos = s.find('-');
        int start = stoi(s.substr(0, pos));
        int stop = stoi(s.substr(pos+1, s.size()));
        start -= (start % 5);
        if(stop % 5 != 0) {
            stop += (5 - stop%5);
            if(stop % 100 == 60) {
                stop += 40;
            }
        }
        v[i] = make_pair(start, stop);
    }

    sort(v.begin(), v.end());
    vector<P> ret;
    int start = -1, stop = -1;
    for(int i=0; i<v.size(); ++i) {
        if(start == -1 && stop == -1) {
            start = v[i].first;
            stop = v[i].second;
        } else if(v[i].first <= stop) {
            stop = max(stop, v[i].second);
        } else {
            ret.push_back(make_pair(start, stop));
            start = v[i].first;
            stop = v[i].second;
        }
    }
    ret.push_back(make_pair(start, stop));

    for(int i=0; i<ret.size(); ++i) {
        cout << setfill('0') << setw(4) << ret[i].first << '-' << setfill('0') << setw(4) << ret[i].second << endl;
    }
}

Submission Info

Judge Result