Submission #1338293


Source Code Expand

#include <iostream>
#include <vector>

using namespace std;

int main(void) {
    int n;
    int temp;
    cin >> n;

    int start;
    int hs;
    int hm;

    int end;
    int es;
    int em;

    vector<vector<int> > table(25, vector<int> (12, 0));
    for (int i = 0; i < n; i++) {
        scanf("%d-%d", &start, &end);
        start -= start % 5;
        if (end % 5 != 0) {
            end = end + 5 - (end % 5);
        }

        hs = start / 100;
        hm = start -  100 * hs;
        es = end / 100;
        em = end - 100 * es;

        while (hs != es) {
            for (int j = hm / 5; j < 12; j++) {
                table[hs][j] = 1;
            }
            hs++;
            hm = 0;
        }
        for (int j = hm / 5; j < em / 5; j++) {
            table[es][j] = 1; 
        }
    }
    bool keizoku = false;
    for (int i = 0; i < 24; i++) {
        for (int j = 0; j < 12; j++) {
            if (table[i][j] == 0 && keizoku == true) {
                keizoku = false;
                printf("%02d%02d\n", i, j * 5);
            }
            if (table[i][j] == 1 && keizoku == false) {
                keizoku = true;
                printf("%02d%02d-", i, j * 5);
            }
        }
    }
    if (keizoku == true) {
        cout << "2400" << endl;
    }

    return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User naobird
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1367 Byte
Status AC
Exec Time 12 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d-%d", &start, &end);
                                     ^

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 48
Set Name Test Cases
all 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 AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
cho_cho_chokudai.txt AC 12 ms 256 KB
chokudai_ga_cho.txt AC 9 ms 256 KB
test_01.txt AC 1 ms 256 KB
test_02.txt AC 1 ms 256 KB
test_03.txt AC 1 ms 256 KB
test_04.txt AC 1 ms 256 KB
test_05.txt AC 1 ms 256 KB
test_06.txt AC 1 ms 256 KB
test_07.txt AC 1 ms 256 KB
test_08.txt AC 1 ms 256 KB
test_09.txt AC 1 ms 256 KB
test_10.txt AC 1 ms 256 KB
test_11.txt AC 1 ms 256 KB
test_12.txt AC 1 ms 256 KB
test_13.txt AC 1 ms 256 KB
test_14.txt AC 1 ms 256 KB
test_15.txt AC 1 ms 256 KB
test_16.txt AC 1 ms 256 KB
test_17.txt AC 1 ms 256 KB
test_18.txt AC 1 ms 256 KB
test_19.txt AC 1 ms 256 KB
test_20.txt AC 1 ms 256 KB
test_21.txt AC 7 ms 256 KB
test_22.txt AC 8 ms 256 KB
test_23.txt AC 7 ms 256 KB
test_24.txt AC 8 ms 256 KB
test_25.txt AC 8 ms 256 KB
test_26.txt AC 6 ms 256 KB
test_27.txt AC 6 ms 256 KB
test_28.txt AC 6 ms 256 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 2 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 4 ms 256 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 8 ms 256 KB
test_37.txt AC 6 ms 256 KB
test_38.txt AC 6 ms 256 KB
test_39.txt AC 7 ms 256 KB
test_40.txt AC 7 ms 256 KB
test_41.txt AC 9 ms 256 KB
test_42.txt AC 10 ms 256 KB
test_43.txt AC 9 ms 256 KB