Submission #1349635


Source Code Expand

Copy
#include <algorithm>
#include <iomanip>
#include <istream>
#include <map>
#include <numeric>
#include <ostream>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <cstdio>
#include <cstring>

using namespace std;

bool timeRange[1442];
class Solution {
public:
    void solve(std::istream& in, std::ostream& out) {
        int n, sh, sm, eh, em;
        memset(timeRange, 0 , sizeof(timeRange));
        in >> n;
        for (int i = 0; i < n; i++)
        {
            char tmp[16];
            in >> tmp;
            sscanf(tmp, "%02d%02d-%02d%02d\n", &sh, &sm, &eh, &em);
            int s = (60 * sh + sm) / 5 * 5;
            int e = (60 * eh + em + 4) / 5 * 5;
            for (int i = s; i < e; i++)
            {
                timeRange[i] = true;
            }
        }

        bool isRange = false;
        int as = 0;
        int ae = 0;
        for (int i = 0; i <= 1441; i++)
        {
            if (timeRange[i])
            {
                if (!isRange)
                {
                    as = 100 * (i / 60) + i % 60;
                }
                isRange = true;
            }
            else
            {
                if (isRange)
                {
                    ae = 100 * (i / 60) + i % 60;

                    char tmp[16];
                    sprintf(tmp, "%04d-%04d", as, ae);
                    out << tmp << endl;
                }
                isRange = false;
            }
        }
    }
};

void solve(std::istream& in, std::ostream& out)
{
    out << std::setprecision(12);
    Solution solution;
    solution.solve(in, out);
}

#include <fstream>
#include <iostream>

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    istream& in = cin;
    ostream& out = cout;
    solve(in, out);
    return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User masakt
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1909 Byte
Status
Exec Time 39 ms
Memory 384 KB

Judge Result

Set Name Score / Max Score Test Cases
all 100 / 100 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, cho_cho_chokudai.txt, chokudai_ga_cho.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt
Case Name Status Exec Time Memory
00_sample_01.txt 1 ms 256 KB
00_sample_02.txt 1 ms 256 KB
00_sample_03.txt 1 ms 256 KB
cho_cho_chokudai.txt 39 ms 256 KB
chokudai_ga_cho.txt 21 ms 256 KB
test_01.txt 2 ms 256 KB
test_02.txt 2 ms 256 KB
test_03.txt 2 ms 256 KB
test_04.txt 2 ms 256 KB
test_05.txt 2 ms 256 KB
test_06.txt 1 ms 256 KB
test_07.txt 1 ms 256 KB
test_08.txt 1 ms 256 KB
test_09.txt 2 ms 256 KB
test_10.txt 2 ms 256 KB
test_11.txt 1 ms 256 KB
test_12.txt 2 ms 256 KB
test_13.txt 1 ms 256 KB
test_14.txt 2 ms 256 KB
test_15.txt 2 ms 256 KB
test_16.txt 1 ms 256 KB
test_17.txt 1 ms 256 KB
test_18.txt 1 ms 256 KB
test_19.txt 1 ms 256 KB
test_20.txt 1 ms 256 KB
test_21.txt 12 ms 256 KB
test_22.txt 16 ms 256 KB
test_23.txt 13 ms 256 KB
test_24.txt 16 ms 256 KB
test_25.txt 14 ms 256 KB
test_26.txt 11 ms 256 KB
test_27.txt 11 ms 256 KB
test_28.txt 11 ms 256 KB
test_29.txt 1 ms 256 KB
test_30.txt 1 ms 256 KB
test_31.txt 3 ms 256 KB
test_32.txt 1 ms 256 KB
test_33.txt 8 ms 256 KB
test_34.txt 1 ms 256 KB
test_35.txt 1 ms 256 KB
test_36.txt 18 ms 256 KB
test_37.txt 11 ms 256 KB
test_38.txt 11 ms 256 KB
test_39.txt 12 ms 384 KB
test_40.txt 12 ms 256 KB
test_41.txt 25 ms 256 KB
test_42.txt 25 ms 256 KB
test_43.txt 25 ms 256 KB