Submission #2551500

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <sstream>
#include <iomanip>
using namespace std;

long long MOD = 1000000007;

int A[12*24+1] = {0};

void func( string s ) {
    int hs = stoi( s.substr(0,2) );
    int ms = stoi( s.substr(2,2) );
    int he = stoi( s.substr(5,2) );
    int me = stoi( s.substr(7,2) );

    ms = (ms/5)*5;
    me = ((me+4)/5)*5;

    int l = (ms + hs*60)/5;
    int r = (me + he*60)/5;

    A[l] |= 1;
    for ( int i = l+1; i < r; i++ ) {
        A[i] = 3;
    }
    A[r] |= 2;
}

string time( int a ) {
    int h = (a*5)/60;
    int m = (a*5)%60;
    string s;
    ostringstream sout;
    sout << setfill('0') << setw(2) << h;
    sout << setfill('0') << setw(2) << m;
    s += sout.str();

    return s;
}

void show() {

    string s,e;
    for ( int i = 0; i <= 12*24; i++ ) {
        if ( A[i] == 1 ) { cout << time(i); }
        else if ( A[i] == 2 ) { cout << "-" << time(i) << endl; }
    }
}

int main() {
    
    int N;
    cin >> N;
    for ( int i = 0; i < N; i++ ) {
        string s;
        cin >> s;
        func(s);
    }
    show();

    return 0;
}

Submission Info

Judge Result