Submission #637468


Source Code Expand

#include "bits/stdc++.h"
using namespace std;

#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repi(i,0,n)
using i64 = int64_t;

int n;
pair<int,int> se[30010];

void solve() {
    vector<pair<int,int>> ps;
    rep(i,n) {
        se[i].first = se[i].first/5*5;
        se[i].second = (se[i].second+4)/5*5;
        if(se[i].second%100 == 60) se[i].second = se[i].second/100*100+100;
    }
    sort(se,se+n);
    pair<int,int> s(-1,-1);
    rep(i,n) {
        if(se[i].first <= s.second) s.second = max(s.second, se[i].second);
        else {
            if(s.first >= 0) ps.push_back(s);
            s = se[i];
        }
    }
    ps.push_back(s);
    for (auto &e: ps) printf("%04d-%04d\n", e.first, e.second);
}

void input() {
    scanf("%d", &n);
    rep(i,n) scanf("%d-%d", &se[i].first, &se[i].second);
}

int main() {
    input();
    solve();
    return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘void input()’:
./Main.cpp:32:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
./Main.cpp:33:57: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     rep(i,n) scanf("%d-%d", &se[i].first, &se[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 27 ms 1000 KB
00_sample_02.txt AC 24 ms 1056 KB
00_sample_03.txt AC 26 ms 1052 KB
cho_cho_chokudai.txt AC 35 ms 1056 KB
chokudai_ga_cho.txt AC 39 ms 1056 KB
test_01.txt AC 27 ms 1016 KB
test_02.txt AC 27 ms 1000 KB
test_03.txt AC 26 ms 1052 KB
test_04.txt AC 25 ms 1008 KB
test_05.txt AC 27 ms 996 KB
test_06.txt AC 29 ms 1052 KB
test_07.txt AC 28 ms 1000 KB
test_08.txt AC 32 ms 984 KB
test_09.txt AC 34 ms 1008 KB
test_10.txt AC 31 ms 1140 KB
test_11.txt AC 28 ms 1056 KB
test_12.txt AC 31 ms 1004 KB
test_13.txt AC 28 ms 1000 KB
test_14.txt AC 28 ms 1052 KB
test_15.txt AC 24 ms 1060 KB
test_16.txt AC 26 ms 1048 KB
test_17.txt AC 28 ms 1000 KB
test_18.txt AC 31 ms 1004 KB
test_19.txt AC 32 ms 1048 KB
test_20.txt AC 32 ms 1164 KB
test_21.txt AC 41 ms 1008 KB
test_22.txt AC 42 ms 992 KB
test_23.txt AC 39 ms 1004 KB
test_24.txt AC 38 ms 1052 KB
test_25.txt AC 37 ms 1052 KB
test_26.txt AC 36 ms 1004 KB
test_27.txt AC 36 ms 1000 KB
test_28.txt AC 39 ms 1056 KB
test_29.txt AC 28 ms 1004 KB
test_30.txt AC 25 ms 1000 KB
test_31.txt AC 28 ms 1004 KB
test_32.txt AC 26 ms 984 KB
test_33.txt AC 34 ms 1176 KB
test_34.txt AC 26 ms 1008 KB
test_35.txt AC 26 ms 1056 KB
test_36.txt AC 39 ms 1056 KB
test_37.txt AC 37 ms 1052 KB
test_38.txt AC 37 ms 1056 KB
test_39.txt AC 37 ms 1056 KB
test_40.txt AC 39 ms 1008 KB
test_41.txt AC 36 ms 1048 KB
test_42.txt AC 38 ms 1052 KB
test_43.txt AC 39 ms 1056 KB