Submission #7582574


Source Code Expand

#include <bits/stdc++.h>
#define range(i, l, r) for(int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

template <typename S, typename T>
ostream& operator <<(ostream& os, pair<S, T> p) {
    os << "(";
    os << p.first << ", " << p.second;
    return os << ")";
}

template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
    os << "[";
    if (v.size() == 0) return os << "]";
    for (int i = 0; i < v.size() - 1; i++) {
        os << v.at(i) << ", ";
    }
    return os << v.at(v.size() - 1) << "]";
}

template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

lint pow(lint num, lint e, lint MOD) {
    lint res = 1;
    lint cur_num = num;
    while (e) {
        if (e & 1) {
            res *= cur_num;
            res %= MOD;
        }
        cur_num *= cur_num;
        cur_num %= MOD;
        e >>= 1;
    }
    return res;
}

int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    auto round_time = [](lint time, bool is_start) {
        lint reminder = time % 5;
        time += (is_start ? -reminder : (5 - reminder) % 5);
        if (time / 100 == 60) time += 40;
        return time;
    };
    auto format = [](plint time) {
        lint s, e; tie(s, e) = time;
        string s_s = to_string(s), s_e = to_string(e);
        string fmt_s = string(4 - s_s.size(), '0').append(s_s), fmt_e = string(4 - s_e.size(), '0').append(s_e);
        string res = fmt_s + "-" + fmt_e;
        return res;
    };
    lint N;
    cin >> N;
    vec<plint> times(N);
    range(i, 0, N) {
        string input;
        lint s, e;
        cin >> input;
        s = stoll(input.substr(0, 4));
        e = stoll(input.substr(5, 4));
        times.at(i) = {round_time(s, true), round_time(e, false)};
    }
    // cout << times << "\n";
    sort(times.begin(), times.end(), [](const plint& a, const plint& b) {return a.first < b.first;});
    times.erase(unique(times.begin(), times.end()), times.end());
    // cout << times << "\n";
    vec<plint> res;
    lint cur_s = times.at(0).first, cur_e = times.at(0).second;
    range(i, 1, times.size()) {
        const plint& time = times.at(i);
        if (time.first <= cur_e) cur_e = max(time.second, cur_e);
        else {
            res.emplace_back(cur_s, cur_e);
            cur_s = time.first;
            cur_e = time.second;
        }
    }
    res.emplace_back(cur_s, cur_e);
    for (const auto& time : res) cout << format(time) << "\n";
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User tmsausa
Language C++14 (GCC 5.4.1)
Score 0
Code Size 4234 Byte
Status WA
Exec Time 15 ms
Memory 768 KB

Judge Result

Set Name all
Score / Max Score 0 / 100
Status
AC × 38
WA × 10
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 WA 12 ms 768 KB
chokudai_ga_cho.txt AC 12 ms 768 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 1 ms 256 KB
test_10.txt AC 1 ms 256 KB
test_11.txt AC 1 ms 256 KB
test_12.txt AC 1 ms 256 KB
test_13.txt AC 1 ms 256 KB
test_14.txt AC 1 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 13 ms 768 KB
test_22.txt AC 13 ms 768 KB
test_23.txt AC 13 ms 768 KB
test_24.txt AC 13 ms 768 KB
test_25.txt AC 13 ms 768 KB
test_26.txt WA 13 ms 768 KB
test_27.txt AC 13 ms 768 KB
test_28.txt WA 13 ms 768 KB
test_29.txt AC 1 ms 256 KB
test_30.txt WA 1 ms 256 KB
test_31.txt WA 3 ms 384 KB
test_32.txt AC 1 ms 256 KB
test_33.txt WA 10 ms 512 KB
test_34.txt AC 1 ms 256 KB
test_35.txt WA 1 ms 256 KB
test_36.txt AC 15 ms 768 KB
test_37.txt WA 13 ms 768 KB
test_38.txt WA 14 ms 768 KB
test_39.txt AC 14 ms 768 KB
test_40.txt WA 14 ms 768 KB
test_41.txt AC 12 ms 768 KB
test_42.txt AC 13 ms 768 KB
test_43.txt AC 12 ms 768 KB