Submission #3931072

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REP(i,b) FOR(i,0,b)
#define RFOR(i,a,b) for (int i = a-1; i >= b; i--)
#define RREP(i,a) RFOR(i,a,0)
#define REPALL(i,v) for (int i = 0; i < v.size(); i++)
#define SORT(v) sort(v.begin(), v.end())
#define MIN_ELEMENT(v) min_element(v.begin(), v.end())
#define MAX_ELEMENT(v) max_element(v.begin(), v.end())
#define COUNT(v,n) count(v.begin(), v.end(), n);
typedef long long ll;
typedef unsigned long long ull;
const int INF = 1e7;
const ll MOD = 1e9 + 7;

int m[12 * 24 + 1];

int main()
{
    int n;
    cin>>n;
    REP(i,n) {
        int s, e;
        char d;
        cin>>s>>d>>e;
        m[(s / 100) * 12 + (s % 100) / 5] += 1;
        m[(e / 100) * 12 + (e % 100 + 4) / 5] -= 1;
    }

    int l = 12 * 24 + 1;
    REP(i,l-1) {
        m[i+1] += m[i];
    }

    bool flag = false;
    REP(i,l) {
        if (flag) {
            if (m[i] == 0) {
                int e = i / 12 * 100 + (i % 12) * 5;
                printf("%04d\n", e);
                flag = false;
            }
        } else {
            if (m[i] > 0) {
                int s = i / 12 * 100 + (i % 12) * 5;
                printf("%04d-", s);
                flag = true;
            }
        }
    }

    return 0;
}

Submission Info

Judge Result