Submission #3735419


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(I,X,Y) for(long long (I)=(X);(I)<(Y);(I)++)
#define REP(I,X,Y) for(long long (I)=(Y)-1;(I)>=(X);(I)--)
#define ALL(X) (X).begin(),(X).end()
#define pb push_back
#define COUNT(V,X) upper_bound((V).begin(),(V).end(),X)-lower_bound((V).begin(),(V).end(),X)
#define debug(x0123456789) cerr<<#x0123456789<<':'<<x0123456789<<endl;
#define DEBUG(v) cerr<<#v<<':';for(auto x0123456789:v)cerr<<x0123456789<<' ';cerr<<endl;
#define INF 1000000007
#define LINF 1000000000000000007
#define EPS 1e-9
typedef long long ll;
typedef long double ld;

int main(){
    int N;
    cin >> N;
    int S[N],E[N];
    int imos[10000]={0};
    FOR(i,0,N){
        string s;
        cin >> s;
        S[i] = stoi(s.substr(0,4));
        E[i] = stoi(s.substr(5,4));
        S[i] = S[i]/5*5;
        E[i] = (E[i]+4)/5*5;
        imos[S[i]]++;
        imos[E[i]+1]--;
    }
    FOR(i,0,9999)imos[i+1]+=imos[i];
    FOR(i,0,50)if(imos[i*100+60]){
        FOR(j,i*100+61,i*100+101)imos[j]=1;
    }
    FOR(i,0,10000){
        if(imos[i]){
            int first = i;
            while(imos[i+1])i++;
            cout << setw(4) << setfill('0') << first << '-' << setw(4) << setfill('0') << i << endl;
        }
    }
}

Submission Info

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

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