Submission #1025755


Source Code Expand

#include <iostream>
#include <string>
#include <sstream>
using namespace std;
bool isRain[1442];
int b, e, ok;

int toTime(int t) {
    return t / 100 * 60 + t % 100;
}
void Rain(string s) {
    string s1, s2;
    stringstream st1, st2;
    int t1, t2;

    s1 = s.substr(0, 4);
    s2 = s.substr(5, 4);
    st1 << s1; st2 << s2;
    st1 >> t1; st2 >> t2;
    t1 = toTime(t1); t2 = toTime(t2);
    t1 = t1 / 5 * 5; t2 = t2 % 5 ? (t2 / 5 + 1) * 5 : t2 / 5 * 5;
    for(int i = t1; i <= t2; i++) isRain[i] = true;
}


void ans(int b, int e) {
    int h1, h2, m1, m2;
    h1 = b / 60; m1 = ((b - h1 * 60) / 5) * 5;
    h2 = e / 60; m2 = (e - h2 * 60) % 5 ? ((e - h2 * 60) / 5 + 1) * 5 : ((e - h2 * 60) / 5) * 5;
    if(h1 < 10) cout << "0";
    cout << h1;
    if(m1 < 10) cout << "0";
    cout << m1 << "-";
    if(h2 < 10) cout << "0";
    cout << h2;
    if(m2 < 10) cout << "0";
    cout << m2 << endl;
}


int main() {
    for(int i = 0; i < 1442; i++) isRain[i] = false;
    int n;
    cin >> n;
    for(int i = 0; i < n; i++) {
        string s;
        cin >> s;
        Rain(s);
    }

    ok = 0;
    for(int i = 0; i < 1442; i++) {
        if(!ok && isRain[i]) {
            b = i;
            ok = 1;
        }
        if(ok && !isRain[i]) {
            e = i - 1;
            ok = 0;
            ans(b, e);
        }
    }
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User legosuke
Language C++ (G++ 4.6.4)
Score 100
Code Size 1396 Byte
Status AC
Exec Time 115 ms
Memory 924 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 19 ms 804 KB
00_sample_02.txt AC 17 ms 720 KB
00_sample_03.txt AC 17 ms 800 KB
cho_cho_chokudai.txt AC 115 ms 800 KB
chokudai_ga_cho.txt AC 94 ms 800 KB
test_01.txt AC 19 ms 804 KB
test_02.txt AC 17 ms 924 KB
test_03.txt AC 17 ms 804 KB
test_04.txt AC 20 ms 676 KB
test_05.txt AC 18 ms 800 KB
test_06.txt AC 19 ms 804 KB
test_07.txt AC 19 ms 804 KB
test_08.txt AC 19 ms 800 KB
test_09.txt AC 21 ms 672 KB
test_10.txt AC 20 ms 676 KB
test_11.txt AC 20 ms 804 KB
test_12.txt AC 20 ms 800 KB
test_13.txt AC 19 ms 804 KB
test_14.txt AC 20 ms 800 KB
test_15.txt AC 19 ms 804 KB
test_16.txt AC 17 ms 804 KB
test_17.txt AC 20 ms 800 KB
test_18.txt AC 19 ms 748 KB
test_19.txt AC 20 ms 908 KB
test_20.txt AC 19 ms 796 KB
test_21.txt AC 87 ms 804 KB
test_22.txt AC 88 ms 800 KB
test_23.txt AC 86 ms 808 KB
test_24.txt AC 86 ms 676 KB
test_25.txt AC 89 ms 812 KB
test_26.txt AC 83 ms 796 KB
test_27.txt AC 84 ms 800 KB
test_28.txt AC 84 ms 804 KB
test_29.txt AC 18 ms 800 KB
test_30.txt AC 19 ms 800 KB
test_31.txt AC 27 ms 800 KB
test_32.txt AC 18 ms 800 KB
test_33.txt AC 63 ms 796 KB
test_34.txt AC 18 ms 868 KB
test_35.txt AC 18 ms 804 KB
test_36.txt AC 92 ms 796 KB
test_37.txt AC 87 ms 804 KB
test_38.txt AC 87 ms 800 KB
test_39.txt AC 85 ms 800 KB
test_40.txt AC 83 ms 916 KB
test_41.txt AC 96 ms 804 KB
test_42.txt AC 96 ms 800 KB
test_43.txt AC 100 ms 800 KB