Submission #1440309

---

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 MOD 1000000007
//#define int long long
using namespace std;
typedef long long ll;
typedef vector<vector<ll>> mat;
const int INF = 1e9;

int N;
int imos[500];
string in;

string format1(int i)
{
    int m = 5 * i;
    char ret[5];
    sprintf(ret, "%02d%02d", m / 60, m % 60);
    string ans(ret);
    return ans.substr(0, 4);
}

string format2(int i)
{
    int m = 5 * i;
    char ret[6];
    sprintf(ret, "%02d%02d-", m / 60, m % 60);
    string ans(ret);
    return ans.substr(0, 5);
}

signed main()
{
    cin >> N;
    REP(i,N) {
        cin >> in;
        int sh, sm, gh, gm, sSum, gSum;
        sh = stoi(in.substr(0, 2));
        sm = stoi(in.substr(2, 2));
        gh = stoi(in.substr(5, 2));
        gm = stoi(in.substr(7, 2));
        sSum = 60 * sh + sm;
        gSum = 60 * gh + gm - 1;

        imos[sSum / 5]++;
        imos[gSum / 5 + 1]--;
    }

    for (int i=1; i<=288; i++) {
        imos[i] += imos[i-1];
    }

    bool start = false;
    for (int i=0; i<=288; i++) {
        if (start) {
            if (imos[i] <= 0) {
                start = false;
                cout << format1(i) << endl;
            }
        } else {
            if (imos[i] > 0) {
                start = true;
                cout << format2(i);
            }
        }
    }

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

Submission Info

Judge Result