Submission #4714801

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <utility>
using ll = long long;
#define MOD 1000000007
using namespace std;

int main(){
    int N;
    cin >> N;
    vector<pair<int,int>> T(N);
    for(int i = 0; i < N; i++)
    {
        char c;
        cin >> T[i].first >> c >> T[i].second;
        T[i].first = T[i].first / 5 * 5;
        T[i].second = (T[i].second + 4) / 5 * 5;
    }
    sort(T.begin(),T.end());
    int a = T[0].first;
    int b = T[0].second;
    for(int i = 1; i < N; i++)
    {
        if (b >= T[i].first) {
            b = max(b,T[i].second);
        }
        else {
            cout << a / 1000;
            a %= 1000;
            cout << a / 100;
            a %= 100;
            cout << a / 10 << a % 10 << "-" << b / 1000;
            b %= 1000;
            cout << b / 100;
            b %= 100;
            cout << b / 10 << b % 10 << endl;
            a = T[i].first;
            b = T[i].second;
        }
    }
    cout << a / 1000;
    a %= 1000;
    cout << a / 100;
    a %= 100;
    cout << a / 10 << a % 10 << "-" << b / 1000;
    b %= 1000;
    cout << b / 100;
    b %= 100;
    cout << b / 10 << b % 10 << endl;
    return 0;
}

Submission Info

Judge Result