Submission #1438300


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <climits>
#include <cmath>
#include <vector>
#include <string>

#define REP(i, n) for (int i=0;i<(n);i++)
#define FOR(i, a, b) for (int i=(a);i<(b);i++)

using namespace std;

struct HM{
    int t1, t2;
};

int main() {
    int N;
    int tmp1, tmp2;
    HM hm[30000];
    int T[289] = {};
    bool flag;
    int tmin, tmax;
    scanf(" %d", &N);
    REP(i, N){
        scanf(" %d-%d", &tmp1, &tmp2);
        tmp1 = tmp1 - tmp1%5;
        if(tmp2%5) tmp2 += (5-tmp2%5);
        if(tmp2%100==60) tmp2 = (tmp2/100+1)*100;
        hm[i].t1 = tmp1/100*12+(tmp1-tmp1/100*100)/5;
        hm[i].t2 = tmp2/100*12+(tmp2-tmp2/100*100)/5;
        T[hm[i].t1] += 1;
        T[hm[i].t2] -= 1;
    }
    //sort(hm, hm+N, [](HM& hm1, HM& hm2){return hm1.t1<hm2.t1;});
    int res = 0;
    flag = false;
    REP(i, 289){
        res += T[i];
        if(T[i] && !flag){
            flag = true;
            tmin = i;
        }
        if(res==0 && flag){
            flag = false;
            tmax = i;
            printf("%04d-%04d\n", tmin/12*100+tmin%12*5, tmax/12*100+tmax%12*5);
        }
    }
    return 0;
}

Submission Info

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

Compile Error

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

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 128 KB
00_sample_02.txt AC 1 ms 128 KB
00_sample_03.txt AC 1 ms 128 KB
cho_cho_chokudai.txt AC 5 ms 128 KB
chokudai_ga_cho.txt AC 5 ms 128 KB
test_01.txt AC 1 ms 128 KB
test_02.txt AC 1 ms 128 KB
test_03.txt AC 1 ms 128 KB
test_04.txt AC 1 ms 128 KB
test_05.txt AC 1 ms 128 KB
test_06.txt AC 1 ms 128 KB
test_07.txt AC 1 ms 128 KB
test_08.txt AC 1 ms 128 KB
test_09.txt AC 1 ms 128 KB
test_10.txt AC 1 ms 128 KB
test_11.txt AC 1 ms 128 KB
test_12.txt AC 1 ms 128 KB
test_13.txt AC 1 ms 128 KB
test_14.txt AC 1 ms 128 KB
test_15.txt AC 1 ms 128 KB
test_16.txt AC 1 ms 128 KB
test_17.txt AC 1 ms 128 KB
test_18.txt AC 1 ms 128 KB
test_19.txt AC 1 ms 128 KB
test_20.txt AC 1 ms 128 KB
test_21.txt AC 5 ms 128 KB
test_22.txt AC 5 ms 128 KB
test_23.txt AC 5 ms 128 KB
test_24.txt AC 5 ms 128 KB
test_25.txt AC 5 ms 128 KB
test_26.txt AC 5 ms 128 KB
test_27.txt AC 5 ms 128 KB
test_28.txt AC 5 ms 128 KB
test_29.txt AC 1 ms 128 KB
test_30.txt AC 1 ms 128 KB
test_31.txt AC 1 ms 128 KB
test_32.txt AC 1 ms 128 KB
test_33.txt AC 4 ms 128 KB
test_34.txt AC 1 ms 128 KB
test_35.txt AC 1 ms 128 KB
test_36.txt AC 6 ms 128 KB
test_37.txt AC 5 ms 128 KB
test_38.txt AC 5 ms 128 KB
test_39.txt AC 5 ms 128 KB
test_40.txt AC 5 ms 128 KB
test_41.txt AC 5 ms 128 KB
test_42.txt AC 5 ms 128 KB
test_43.txt AC 5 ms 128 KB