Submission #871641


Source Code Expand

#include<iostream>
#include<map>
#include<algorithm>
#include<vector>
using namespace std;

int main()
{
    int n;
    int st, ed;
    pair<int, int> tm[30000];

    cin >> n;

    for (int i = 0; i < n; ++i) {
        scanf("%4d-%4d", &st, &ed);
        tm[i].first = st;
        tm[i].second = ed;

        if ((tm[i].first) % 5!=0) {
            tm[i].first -= (tm[i].first) % 5;
        }
        if ((tm[i].second) % 5 != 0){
            tm[i].second += 5 - (tm[i].second) % 5;
            if ((tm[i].second) % 100 == 60) {
                tm[i].second = tm[i].second - 60 + 100;
            }

        }
    }//set

    sort(tm, tm + n);

    vector<pair<int, int>>ans;
    int a = tm[0].first;
    int b = tm[0].second;
    for (int i = 0; i < n; ++i) {
        if (tm[i].first <= b) {
            b = max(b, tm[i].second);
        }
        else {
            ans.push_back({ a,b });
            a = tm[i].first;
            b = tm[i].second;
        }
    }

    ans.push_back({ a,b });
    for (int i = 0; i < ans.size();++i)
    printf("%04d-%04d\n", ans[i].first,ans[i].second);

    return 0;

}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User Yang33
Language C++11 (GCC 4.8.1)
Score 100
Code Size 1162 Byte
Status AC
Exec Time 39 ms
Memory 1064 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:16:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%4d-%4d", &st, &ed);
                                   ^

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 932 KB
00_sample_02.txt AC 28 ms 1008 KB
00_sample_03.txt AC 23 ms 1056 KB
cho_cho_chokudai.txt AC 33 ms 996 KB
chokudai_ga_cho.txt AC 39 ms 932 KB
test_01.txt AC 24 ms 932 KB
test_02.txt AC 26 ms 932 KB
test_03.txt AC 25 ms 1060 KB
test_04.txt AC 25 ms 928 KB
test_05.txt AC 24 ms 1056 KB
test_06.txt AC 24 ms 928 KB
test_07.txt AC 26 ms 932 KB
test_08.txt AC 25 ms 1052 KB
test_09.txt AC 26 ms 932 KB
test_10.txt AC 25 ms 932 KB
test_11.txt AC 25 ms 1048 KB
test_12.txt AC 24 ms 932 KB
test_13.txt AC 25 ms 1056 KB
test_14.txt AC 25 ms 932 KB
test_15.txt AC 26 ms 928 KB
test_16.txt AC 25 ms 928 KB
test_17.txt AC 26 ms 928 KB
test_18.txt AC 24 ms 932 KB
test_19.txt AC 24 ms 928 KB
test_20.txt AC 26 ms 936 KB
test_21.txt AC 39 ms 928 KB
test_22.txt AC 39 ms 932 KB
test_23.txt AC 36 ms 1056 KB
test_24.txt AC 37 ms 1052 KB
test_25.txt AC 36 ms 1056 KB
test_26.txt AC 35 ms 1052 KB
test_27.txt AC 36 ms 928 KB
test_28.txt AC 36 ms 936 KB
test_29.txt AC 25 ms 924 KB
test_30.txt AC 26 ms 1060 KB
test_31.txt AC 28 ms 1056 KB
test_32.txt AC 26 ms 928 KB
test_33.txt AC 33 ms 928 KB
test_34.txt AC 26 ms 1056 KB
test_35.txt AC 26 ms 1056 KB
test_36.txt AC 38 ms 932 KB
test_37.txt AC 36 ms 936 KB
test_38.txt AC 37 ms 1064 KB
test_39.txt AC 38 ms 936 KB
test_40.txt AC 39 ms 936 KB
test_41.txt AC 36 ms 932 KB
test_42.txt AC 37 ms 932 KB
test_43.txt AC 38 ms 928 KB