Submission #1439582


Source Code Expand

#include <iostream>
#include <vector>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <cstdio>

using namespace std;
using llng = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
template<class T> using hset = unordered_set<T>;
template<class Key, class T> using hmap = unordered_map<Key, T>;

int main() {
    int N; cin >> N;
    vector<pair<int, int> > T(N);
    for (int i=0; i<N; i++) {
        scanf("%d-%d", &T[i].first, &T[i].second);
        T[i].first -= (T[i].first % 5);
        T[i].second = T[i].second + (5 - (T[i].second % 5)) % 5;
        T[i].second = (T[i].second / 100 + (T[i].second % 100) / 60) * 100 + (T[i].second % 100 % 60);
    }
    sort(T.begin(), T.end());

    vector<pair<int, int> > ans;
    for (int i=0; i<N; i++) {
        pair<int, int> p = make_pair(T[i].first, T[i].second);
        while (true) {
            if (i >= N-1) break;
            if (T[i+1].first > p.second) break;
            if (T[i+1].second > p.second) p.second = T[i+1].second;
            i++;
        }
        ans.push_back(p);
    }

    for (auto itr : ans) printf("%04d-%04d\n", itr.first, itr.second);
    return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:20:50: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d-%d", &T[i].first, &T[i].second);
                                                  ^

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 7 ms 512 KB
chokudai_ga_cho.txt AC 7 ms 512 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 1 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 8 ms 512 KB
test_22.txt AC 8 ms 512 KB
test_23.txt AC 9 ms 512 KB
test_24.txt AC 8 ms 512 KB
test_25.txt AC 8 ms 512 KB
test_26.txt AC 8 ms 512 KB
test_27.txt AC 7 ms 512 KB
test_28.txt AC 8 ms 512 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 2 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 6 ms 384 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 9 ms 512 KB
test_37.txt AC 15 ms 512 KB
test_38.txt AC 8 ms 512 KB
test_39.txt AC 8 ms 512 KB
test_40.txt AC 8 ms 512 KB
test_41.txt AC 7 ms 512 KB
test_42.txt AC 8 ms 512 KB
test_43.txt AC 7 ms 512 KB