Submission #349250

---

Source Code Expand

//
//  main.cpp
//  1
//
//  Created by TangNing on 3/4/15.
//  Copyright (c) 2015 Ning Tang. All rights reserved.
//

#include <iostream>
#include <cstdlib>
#include <sstream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <math.h>
#include <bitset>

using namespace std;
typedef long long ll;
typedef unsigned long long ull;

int main(int argc, const char * argv[]) {
    int N, s, t;
    int time[300] = {};
    string H;
    cin >> N;
    for (int i = 0; i < N; ++i) {
        cin >> H;
        s = atoi(H.substr(0, 4).c_str());
        t = atoi(H.substr(5).c_str());
        int si = (s / 100) * 12 + (s % 100) / 5;
        int ti = (t / 100) * 12 + ceil((t % 100) / 5.0);
//        printf("%02d%02d-%02d%02d\n", si / 12, (si % 12) * 5, (ti) / 12, ((ti) % 12) * 5);
        time[si]++;
        time[ti]--;
    }
    
    for (int i = 1; i < 300; ++i) {
        time[i] += time[i - 1];
    }
    bool match = false;
    for (int i = 0; i < 300; ++i) {
        if (time[i] && !match) {
            match = true;
            printf("%02d%02d-", i / 12, (i % 12) * 5);
        } else if (!time[i] && match) {
            match = false;
            printf("%02d%02d\n", i / 12, (i % 12) * 5);
        }
    }
    
    return 0;
}

Submission Info

Judge Result