Submission #881854


Source Code Expand

#include <bits/stdc++.h>
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

typedef long long ll;
typedef pair<int, int> ii;

int main(){

  int n;
  cin >> n;

  priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > que;

  rep(i, n){
    int s, e;
    scanf("%d-%d", &s, &e);

    int s1 = s%10, e1 = e%10;
    if(s1 <= 4) s = s - s1;
    else  s = s - s1 + 5;
    if(e1 == 0) e = e;
    else if(e1 <= 5) e = e - e1 + 5;
    else e = e - e1 + 10;
    if(e % 100 == 60) e = e + 40;

    que.push(make_pair(s, e));
  }

  pair<int, int> nw = make_pair(0,0);
  bool one = true;
  while(!que.empty()){
    pair<int, int> buff = que.top();
    que.pop();

    if(nw.second >= buff.first){
      if(one) cout << "0000";
      nw.second = max(nw.second, buff.second);
    }
    else{
      if(!one) printf("-%04d\n", nw.second);
      nw = buff;
      printf("%04d", nw.first);
    }

    one = false;

  }
printf("-%04d\n", nw.second);

  return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User letter
Language C++ (G++ 4.6.4)
Score 100
Code Size 1162 Byte
Status AC
Exec Time 46 ms
Memory 1308 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:22:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

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 26 ms 800 KB
00_sample_02.txt AC 25 ms 804 KB
00_sample_03.txt AC 25 ms 676 KB
cho_cho_chokudai.txt AC 39 ms 1192 KB
chokudai_ga_cho.txt AC 44 ms 1188 KB
test_01.txt AC 27 ms 800 KB
test_02.txt AC 25 ms 800 KB
test_03.txt AC 28 ms 804 KB
test_04.txt AC 27 ms 800 KB
test_05.txt AC 26 ms 804 KB
test_06.txt AC 26 ms 800 KB
test_07.txt AC 26 ms 800 KB
test_08.txt AC 27 ms 788 KB
test_09.txt AC 26 ms 804 KB
test_10.txt AC 25 ms 796 KB
test_11.txt AC 27 ms 796 KB
test_12.txt AC 26 ms 796 KB
test_13.txt AC 26 ms 928 KB
test_14.txt AC 27 ms 800 KB
test_15.txt AC 27 ms 796 KB
test_16.txt AC 24 ms 800 KB
test_17.txt AC 25 ms 812 KB
test_18.txt AC 27 ms 928 KB
test_19.txt AC 25 ms 924 KB
test_20.txt AC 27 ms 812 KB
test_21.txt AC 42 ms 1176 KB
test_22.txt AC 43 ms 1180 KB
test_23.txt AC 44 ms 1192 KB
test_24.txt AC 44 ms 1180 KB
test_25.txt AC 45 ms 1180 KB
test_26.txt AC 41 ms 1308 KB
test_27.txt AC 41 ms 1184 KB
test_28.txt AC 43 ms 1188 KB
test_29.txt AC 27 ms 932 KB
test_30.txt AC 24 ms 800 KB
test_31.txt AC 29 ms 812 KB
test_32.txt AC 27 ms 672 KB
test_33.txt AC 38 ms 1184 KB
test_34.txt AC 25 ms 676 KB
test_35.txt AC 27 ms 800 KB
test_36.txt AC 44 ms 1180 KB
test_37.txt AC 43 ms 1184 KB
test_38.txt AC 44 ms 1196 KB
test_39.txt AC 44 ms 1184 KB
test_40.txt AC 46 ms 1184 KB
test_41.txt AC 41 ms 1184 KB
test_42.txt AC 43 ms 1188 KB
test_43.txt AC 40 ms 1308 KB