Submission #4026651

---

Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <string>
#include <algorithm>
#include <cmath>
#include <ctype.h>
using namespace std;
#define dump(a) cout << (a) << '\n';
typedef long long Int;
Int mod = 1e9+7;
Int MOD = 998244353;

int main() {
    ios::sync_with_stdio(false);
    Int n;
    cin >> n;
    vector<pair<string, string>> p(n);
    for (Int i = 0; i < n; i++) {
        string a;
        cin >> a;
        p[i].first = a.substr(0, 4);
        p[i].second = a.substr(5, 4);
    }
    sort(p.begin(), p.end());
    vector<string> s(n), t(n);
    for (Int i = 0; i < n; i++) {
        s[i] = p[i].first;
        t[i] = p[i].second;
    }
    for (Int i = 0; i < n; i++) {
        if ('0' < s[i][3] && s[i][3] < '5') s[i][3] = '0';
        else if ('5' < s[i][3] && s[i][3] <= '9') s[i][3] = '5';
        if ('0' < t[i][3] && t[i][3] < '5') t[i][3] = '5';
        else if ('5' < t[i][3] && t[i][3] <= '9') {
            t[i][2] = t[i][2] + 1;
            t[i][3] = '0';
        }
        if (t[i][2] == '6') {
            t[i][1] = t[i][1] + 1;
            t[i][2] = '0';
        }
    }
    for (Int i = 0; i < n; i++) {
        cout << s[i] << "-";
        while (i < n - 1 && t[i] >= s[i + 1]) i++;
        cout << t[i] << '\n';
    }
    return 0;  
} 

Submission Info

Judge Result