Submission #3430004

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
constexpr int MOD = 1000000007;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};

template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){os << "["; for (const auto &v : vec) {os << v << ","; } os << "]"; return os; }
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}

int f(int k) {
    int t = k % 100;
    if (t >= 60) {
        return k / 100 * 100 + 100 + (k % 100) % 60; 
    }
    return k;
}

void solve() {
    int N;
    cin >> N;
    vector<pii> A;
    for (int i = 0; i < N; i++) {
        string s;
        cin >> s;
        int l = stoi(s.substr(0, 4));
        int r = stoi(s.substr(5));
        l = (l / 5) * 5;
        r = ((r + 4) / 5) * 5;
        A.push_back({f(l), f(r)});
    }
    sort(all(A));
    int nows = A[0].first;
    int nowt = A[0].second;
    for(int i = 1; i < N; i++) {
        if (A[i].first <= nowt) {
            nowt = max(nowt, A[i].second);
        } else {
            printf("%04d-%04d\n", nows, nowt);
            nows = A[i].first;
            nowt = A[i].second;
        }
    }
    printf("%04d-%04d\n", nows, nowt);
}

int main() {
    solve();
    return 0;
}

Submission Info

Judge Result