Submission #613001


Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<iomanip>
#include<cstdlib>
#include<algorithm>

typedef struct rain{
    // 雨の降り始めと終わりを記録
    int start, end;
}RAIN;

void update(std::vector<RAIN> &v, int rain_start, int rain_end){
    for(size_t i = 0; i < v.size(); ++i){
        int s = v[i].start;
        int e = v[i].end;
        if(s <= rain_start && rain_end <= e) return;
        if(s <= rain_end && rain_end <= e && rain_start <= s){
            v[i].start = rain_start;
            return;
        }
        if(s <= rain_start && rain_start <= e && e <= rain_end){
            v[i].end = rain_end;
            return;
        }
    }
    RAIN r;
    r.start = rain_start;
    r.end = rain_end;
    v.push_back(r);
}

int main(){
    int n;
    std::vector<RAIN> v;
    std::vector<std::string> times;

    std::cin >> n;
    for(int i = 0; i < n; ++i){
        std::string str;
        std::cin >> str;
        times.push_back(str);
    }

    std::sort(times.begin(), times.end());

    for(int i = 0; i < n; ++i){
        int s = atoi(times[i].substr(0, 4).c_str());
        int e = atoi(times[i].substr(5, 4).c_str());
        s = (s % 100 / 5) + (s / 100 * 12);
        e = ((e + 4) % 100 / 5) + (e / 100 * 12);
        update(v, s, e);
    }

    for(RAIN r : v){
        int s = (r.start / 12 * 100) + (r.start % 12 * 5);
        int e = (r.end / 12 * 100) + (r.end % 12 * 5);
        std::cout << std::setw(4) << std::setfill('0') << s << "-" \
                    << std::setw(4) << std::setfill('0')<< e << std::endl;
    }
    return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User Kampachi
Language C++11 (GCC 4.8.1)
Score 100
Code Size 1661 Byte
Status AC
Exec Time 95 ms
Memory 2980 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 24 ms 800 KB
00_sample_02.txt AC 25 ms 932 KB
00_sample_03.txt AC 24 ms 808 KB
cho_cho_chokudai.txt AC 81 ms 2980 KB
chokudai_ga_cho.txt AC 95 ms 2980 KB
test_01.txt AC 25 ms 932 KB
test_02.txt AC 23 ms 928 KB
test_03.txt AC 25 ms 932 KB
test_04.txt AC 25 ms 932 KB
test_05.txt AC 25 ms 804 KB
test_06.txt AC 26 ms 928 KB
test_07.txt AC 25 ms 804 KB
test_08.txt AC 23 ms 936 KB
test_09.txt AC 25 ms 800 KB
test_10.txt AC 26 ms 924 KB
test_11.txt AC 25 ms 804 KB
test_12.txt AC 26 ms 800 KB
test_13.txt AC 25 ms 936 KB
test_14.txt AC 27 ms 804 KB
test_15.txt AC 26 ms 928 KB
test_16.txt AC 28 ms 800 KB
test_17.txt AC 25 ms 928 KB
test_18.txt AC 26 ms 928 KB
test_19.txt AC 28 ms 808 KB
test_20.txt AC 26 ms 924 KB
test_21.txt AC 90 ms 2968 KB
test_22.txt AC 92 ms 2980 KB
test_23.txt AC 90 ms 2976 KB
test_24.txt AC 89 ms 2980 KB
test_25.txt AC 88 ms 2972 KB
test_26.txt AC 87 ms 2980 KB
test_27.txt AC 79 ms 2980 KB
test_28.txt AC 90 ms 2972 KB
test_29.txt AC 24 ms 796 KB
test_30.txt AC 26 ms 932 KB
test_31.txt AC 34 ms 1184 KB
test_32.txt AC 25 ms 932 KB
test_33.txt AC 67 ms 2332 KB
test_34.txt AC 26 ms 932 KB
test_35.txt AC 24 ms 808 KB
test_36.txt AC 90 ms 2972 KB
test_37.txt AC 92 ms 2972 KB
test_38.txt AC 87 ms 2980 KB
test_39.txt AC 89 ms 2972 KB
test_40.txt AC 91 ms 2976 KB
test_41.txt AC 84 ms 2980 KB
test_42.txt AC 85 ms 2980 KB
test_43.txt AC 93 ms 2976 KB