Submission #2294507


Source Code Expand

#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;

// メモ構造体の管理
typedef struct {
    int s;
    int e;
} MEMO;

// ソートのpredicator
bool start_time(const MEMO& m1, const MEMO& m2) {
    return m1.s < m2.s;
}

int main()
{
    int N;
    cin >> N;

    // 入力
    MEMO data[N];
    for (int i = 0; i < N; i++) {
        int s, e;
        scanf("%d-%d", &s, &e);
        // 5分単位で丸めておく
        s -= (s % 5);
        e = e % 5 == 0 ? e : e + 5 - e % 5;
        e = e % 100 == 60 ? e + 40 : e;
        data[i].s = s, data[i].e = e;
    }

    // 昇順ソート
    sort(data, data + N, start_time);

    // 統合処理
    int current_s = data[0].s, current_e = data[0].e;
    for (int i = 1; i < N; i++) {
        if (data[i].s > current_e) {
            printf("%04d-%04d\n", current_s, current_e);
            current_s = data[i].s;
            current_e = data[i].e;
        } else {
            current_e = data[i].e > current_e ? data[i].e : current_e;
        }
    }
    printf("%04d-%04d\n", current_s, current_e);

    return 0;
}

Submission Info

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

Compile Error

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

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 7 ms 512 KB
chokudai_ga_cho.txt AC 7 ms 512 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 9 ms 512 KB
test_22.txt AC 8 ms 512 KB
test_23.txt AC 8 ms 512 KB
test_24.txt AC 8 ms 512 KB
test_25.txt AC 8 ms 512 KB
test_26.txt AC 8 ms 512 KB
test_27.txt AC 7 ms 512 KB
test_28.txt AC 8 ms 512 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 6 ms 384 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 8 ms 512 KB
test_37.txt AC 8 ms 512 KB
test_38.txt AC 8 ms 512 KB
test_39.txt AC 8 ms 512 KB
test_40.txt AC 8 ms 512 KB
test_41.txt AC 7 ms 512 KB
test_42.txt AC 8 ms 512 KB
test_43.txt AC 7 ms 512 KB