Submission #4627817


Source Code Expand

// 2019/3/19
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <utility>
#define N 30000

using namespace std;

//vector< pair<int, int> > se(N, pair<int, int>(0,0));
vector< pair<int, int> > se(N, make_pair(0,0));

void dump(int n){
  for (int i = 0; i < n; i++){
    cout << se[i].first << " " << se[i].second << endl;
  }
}
void round_s(int n){
  for (int i = 0; i < n; i++){
    se[i].first = se[i].first - se[i].first % 5;
  }
}
void round_e(int n){
  for (int i = 0; i < n; i++){
    if (56 <= se[i].second % 100){
      se[i].second = se[i].second + 100 - se[i].second % 100;
    }
    else
      se[i].second = se[i].second + (se[i].second % 5 == 0 ? 0 : 5 - se[i].second % 5);
  }
}
int main(void){
  int n;

  cin >> n;



  for (int i = 0; i < n; i++){
    scanf("%d-%d", &(se[i].first), &(se[i].second));
  }
  round_s(n);
  round_e(n);

  sort(se.begin(), se.begin() + n);


  int start = se[0].first;
  int end = se[0].second; 
  for (int i = 0; i < n; i++){
    if (se[i].first <= end){
      end = max(end, se[i].second);
    }
    else {
      printf("%04d-%04d\n", start, end);
      start = se[i].first;
      end = se[i].second;
    }
  }
  printf("%04d-%04d\n", start, end);


//  dump(n);

}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:41:52: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     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 1 ms 512 KB
00_sample_02.txt AC 1 ms 512 KB
00_sample_03.txt AC 1 ms 512 KB
cho_cho_chokudai.txt AC 7 ms 512 KB
chokudai_ga_cho.txt AC 7 ms 512 KB
test_01.txt AC 1 ms 512 KB
test_02.txt AC 1 ms 512 KB
test_03.txt AC 1 ms 512 KB
test_04.txt AC 1 ms 512 KB
test_05.txt AC 1 ms 512 KB
test_06.txt AC 1 ms 512 KB
test_07.txt AC 1 ms 512 KB
test_08.txt AC 1 ms 512 KB
test_09.txt AC 1 ms 512 KB
test_10.txt AC 1 ms 512 KB
test_11.txt AC 1 ms 512 KB
test_12.txt AC 1 ms 512 KB
test_13.txt AC 1 ms 512 KB
test_14.txt AC 1 ms 512 KB
test_15.txt AC 2 ms 512 KB
test_16.txt AC 1 ms 512 KB
test_17.txt AC 1 ms 512 KB
test_18.txt AC 1 ms 512 KB
test_19.txt AC 1 ms 512 KB
test_20.txt AC 1 ms 512 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 512 KB
test_30.txt AC 1 ms 512 KB
test_31.txt AC 2 ms 512 KB
test_32.txt AC 1 ms 512 KB
test_33.txt AC 6 ms 512 KB
test_34.txt AC 1 ms 512 KB
test_35.txt AC 1 ms 512 KB
test_36.txt AC 9 ms 512 KB
test_37.txt AC 10 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 6 ms 512 KB