Submission #404963

---

Source Code Expand

#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <utility>
#include <vector>

using namespace std;

typedef long long Long;
#define whole(xs) xs.begin(), xs.end()
#define uniq(xs) (xs.erase(unique(xs.begin(), xs.end()), xs.end()))

template<class T>
ostream& operator<<(ostream& os, const vector<T>& vs) {
    if (vs.empty()) return os << "[]";
    os << "[" << vs[0];
    for (int i = 1; i < vs.size(); i++) os << " " << vs[i];
    return os << "]";
}

const int IINF = 1<<28;
const Long LINF = 1LL<<56;
#define INF IINF

int to_i(string s) {
    istringstream is(s);
    int r; is >> r;
    return r;
}

string to_s(int n) {
    char buf[256];
    sprintf(buf, "%02d%02d", n / 60, n % 60);
    return string(buf);
}

int N;
vector< pair<int, int> > I;
void Input() {
    cin >> N;
    I.clear(); I.resize(N);
    for (int i = 0; i < N; i++) {
        string L; cin >> L;
        string Ss = L.substr(0, 4),
               Ts = L.substr(5, 4);
        int S = to_i(Ss.substr(0, 2)) * 60 + to_i(Ss.substr(2, 2)),
            T = to_i(Ts.substr(0, 2)) * 60 + to_i(Ts.substr(2, 2));
        int dS = S % 5,
            dT = T % 5 == 0 ? 0 : 5 - T % 5;
        I[i] = make_pair(S - dS, T + dT);
    }
}

void Solve() {
    int F[24 * 60 + 2];
    memset(F, 0, sizeof(F));
    for (int i = 0; i < N; i++) {
        int s = I[i].first,
            t = I[i].second;
        F[s]++;
        F[t]--;
    }
    int C = 0;
    bool G[24 * 60 + 2];
    memset(G, 0, sizeof(G));
    for (int t = 0; t <= 24 * 60 + 1; t++) {
        C += F[t];
        if (C > 0) {
            G[t] = true;
        }
    }
    int state = 0;
    int S, T;
    for (int t = 0; t <= 24 * 60 + 1; t++) {
        if (!state && G[t]) {
            state = !state;
            S = t;
        } else if (state && !G[t]) {
            state = !state;
            T = t;
            cout << to_s(S) << "-" << to_s(T) << endl;
        }
    }
}

int main() {
    Input(); Solve();
    return 0;
}

Submission Info

Judge Result