Submission #1587097

---

Source Code Expand

#include <bits/stdc++.h>
#define FOR(i,bg,ed) for(ll i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) for(ll i=1;i<=(n);i++)
#define MOD 1000000007
//#define int long long
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<int> vec;
typedef vector<vec> mat;
const int INF = 1e9;

int N;  //データの個数
int S;  //降り始めの時刻
int E;  //降り終わりの時刻
char c; //入力用
int imos[12*24+5];

signed main()
{
    cin >> N;
    REP(i,N) {
        cin >> S >> c >> E;
        int sh = S / 100, sm = S % 100;
        int eh = E / 100, em = E % 100;
        imos[12*sh+sm/5]++;
        if (em == 0) {
            imos[12*eh+(em-1)/5]--;
        } else {
            imos[12*eh+(em-1)/5+1]--;
        }
    }

    for (int i=1; i<12*24+5; i++) {
        imos[i] += imos[i-1];
    }

    bool start = false;
    for (int i=0; i<12*24+1; i++) {
        if (imos[i] > 0 && !start) {
            printf("%02d%02d-", i*5/60, i*5%60);
            start = true;
        }
        if (imos[i] <= 0 && start) {
            printf("%02d%02d\n", i*5/60, i*5%60);
            start = false;
        }
    }

    if (start) {
        cout << "2400" << endl;
    }
}

Submission Info

Judge Result