Submission #1419460


Source Code Expand

#include <bits/stdc++.h>
#include <iomanip>
using namespace std;

#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false

int main()
{
    vector<pair<int, int> > kanu;
    int n;
    pair<int, int> hoge;
    cin >> n;
    rep(i, n)
    {
        scanf("%d-%d", &hoge.first, &hoge.second);
        kanu.push_back(hoge);
        kanu[i].first = kanu[i].first - (kanu[i].first % 100) % 5;
        if ((kanu[i].second % 100) % 5 != 0)
            kanu[i].second = kanu[i].second - (kanu[i].second % 100) % 5 + 5;
        if (kanu[i].second % 100 == 60)
        {
            kanu[i].second += 100;
            kanu[i].second -= 60;
        }
    }
    SORT(kanu);
    int start = kanu[0].first, end = kanu[0].second;
    rep(i, n)
    {
        if (kanu[i].first <= end)
        {
            end = max(kanu[i].second, end);
        }
        else
        {
     cout << setfill('0') << setw(4) << right << start << "-";
    cout << setfill('0') << setw(4) << right << end << endl;
            start = kanu[i].first;
            end = kanu[i].second;
        }
    }
    cout << setfill('0') << setw(4) << right << start << "-";
    cout << setfill('0') << setw(4) << right << end << endl;

    return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User ToM_ynu
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1388 Byte
Status AC
Exec Time 9 ms
Memory 640 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", &hoge.first, &hoge.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 640 KB
chokudai_ga_cho.txt AC 7 ms 640 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 9 ms 640 KB
test_22.txt AC 8 ms 640 KB
test_23.txt AC 9 ms 640 KB
test_24.txt AC 9 ms 640 KB
test_25.txt AC 9 ms 640 KB
test_26.txt AC 8 ms 640 KB
test_27.txt AC 7 ms 640 KB
test_28.txt AC 8 ms 640 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 2 ms 384 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 6 ms 640 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 9 ms 640 KB
test_37.txt AC 8 ms 640 KB
test_38.txt AC 8 ms 640 KB
test_39.txt AC 8 ms 640 KB
test_40.txt AC 8 ms 640 KB
test_41.txt AC 7 ms 640 KB
test_42.txt AC 8 ms 640 KB
test_43.txt AC 7 ms 640 KB