Submission #2068031


Source Code Expand

#include<stdio.h>
#include<vector>
#include<algorithm>
#include<functional>
#include<map>

#define FOR(i,a,b) for(int i=(a);i<(b);++i)

using namespace std;

int main(){
  int n,i;
  int s,e;
  vector<int> time(24*12+1,0);

  auto smaru = [] (int s){
    if(s%10<5) return (s/10) * 10;
    else return (s/10) * 10 + 5;
  };

  auto emaru = [] (int e){
    if(e%10>5 || e%10==0) return ((e+9)/10) * 10;
    else return (e/10) * 10 + 5;
  };

  function<void(int)> printame = [](int d){
    if(d < 10) printf("000%d",d);
    else if(d < 100) printf("00%d",d);
    else if(d < 1000) printf("0%d",d);
    else printf("%d",d);
  };

  scanf("%d", &n);
  vector<pair<int,int>> vp(n);
  FOR(i,0,n){
    scanf("%d-%d", &s,&e);
    vp[i] = make_pair(smaru(s),emaru(e));
  }
  sort(vp.begin(),vp.end());

  FOR(i,0,n){
    time[(vp[i].first/100)*12 + (vp[i].first%100/5)] += 1;
    time[(vp[i].second/100)*12 + (vp[i].second%100/5)] -= 1;
  }
  FOR(i,0,24*12){
    time[i+1] += time[i];
  }

  bool jud=true;
  FOR(i,0,24*12+1){
    if(jud){
      if(time[i] <= 0) continue;
      else{
        printame(i/12*100 + i%12*5);
        printf("-");
        jud = false;
      }
    }else{
      if(time[i] > 0) continue;
      else{
        printame(i/12*100 + i%12*5);
        printf("\n");
        jud = true;
      }
    }
  }


  return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:33:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
                  ^
./Main.cpp:36:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d-%d", &s,&e);
                          ^

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 8 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 9 ms 512 KB
test_22.txt AC 9 ms 512 KB
test_23.txt AC 9 ms 512 KB
test_24.txt AC 9 ms 512 KB
test_25.txt AC 9 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 8 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