Submission #757624

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <list>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>

using namespace std;

int toMinutes(int time)
{
    return time / 100 * 60 + time % 100;
}

int toTime(int minutes)
{
    return minutes / 60 * 100 + (minutes % 60);
}

int main()
{
    int n;
    cin >> n;
    list<pair<int, int>> inputList;
    for(int i = 0; i < n; ++i) {
        int s, e;
        char a;
        cin >> s >> a >> e;
        s = toMinutes(s) / 5 * 5;
        e = (toMinutes(e) + 4) / 5 * 5;
        inputList.push_back(make_pair(s, e));
    }
    inputList.sort();
    inputList.unique();

    vector<int> imosu(24 * 60 / 5 + 1);
    for_each(inputList.begin(), inputList.end(), [&](pair<int, int> p) {
        imosu[p.first / 5] += 1;
        imosu[p.second / 5] += -1;
    });
    for(int i = 1; i < imosu.size(); ++i) {
        imosu[i] += imosu[i - 1];
    }
    list<pair<int, int>> outputList;
    bool isInner = false;
    int b;
    for(int i = 0; i < imosu.size(); ++i) {
        if(imosu[i] > 0 && !isInner) {
            isInner = true;
            b = i * 5;
        }
        if(imosu[i] <= 0 && isInner) {
            isInner = false;
            outputList.push_back(make_pair(b, i * 5));
        }
    }

    for_each(outputList.begin(), outputList.end(), [](pair<int, int> p) {
        cout << setfill('0') << setw(4) << toTime(p.first) << "-" << setw(4) << toTime(p.second) << endl;
    });
}

Submission Info

Judge Result