AtCoder Beginner Contest 001

Submission #1354433

Source codeソースコード

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n; cin>>n;
    vector<bool> f(2400);
    for(int i=0; i<n; ++i) {
        int a, b;
        scanf("%d-%d", &a, &b);
        a-=a%5;
        a=a/100*60+a%100;
        if (b%5) b=b-b%5+5;
        b=b/100*60+b%100;
        while (a<=b) f[a++]=1;
    }
    bool x=0;
    for(int i=0; i<2400; ++i) {
        if (f[i] && !x) {
            printf("%02d%02d-", i/60, i%60);
            x=1;
        }
        else if (!f[i] && x) {
            printf("%02d%02d\n", ~-i/60, ~-i%60);
            x=0;
        }
    }
}

Submission

Task問題 D - 感雨時刻の整理
User nameユーザ名 hogeover30
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 100
Source lengthソースコード長 605 Byte
File nameファイル名
Exec time実行時間 78 ms
Memory usageメモリ使用量 256 KB

Compiler messageコンパイルメッセージ

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

Test case

Set

Set name Score得点 / Max score 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
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 78 ms 256 KB
chokudai_ga_cho.txt AC 30 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 2 ms 256 KB
test_10.txt AC 2 ms 256 KB
test_11.txt AC 1 ms 256 KB
test_12.txt AC 2 ms 256 KB
test_13.txt AC 1 ms 256 KB
test_14.txt AC 2 ms 256 KB
test_15.txt AC 2 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 10 ms 256 KB
test_22.txt AC 18 ms 256 KB
test_23.txt AC 11 ms 256 KB
test_24.txt AC 18 ms 256 KB
test_25.txt AC 13 ms 256 KB
test_26.txt AC 6 ms 256 KB
test_27.txt AC 6 ms 256 KB
test_28.txt AC 7 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 5 ms 256 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 24 ms 256 KB
test_37.txt AC 6 ms 256 KB
test_38.txt AC 6 ms 256 KB
test_39.txt AC 8 ms 256 KB
test_40.txt AC 8 ms 256 KB
test_41.txt AC 42 ms 256 KB
test_42.txt AC 43 ms 256 KB
test_43.txt AC 43 ms 256 KB