Submission #2120302

---

Source Code Expand

#include <iostream>
#include <string>
#include <cstdio>
using namespace std;

int sto(string s) {
  int n = 0;
  for(int i=0; i < s.size(); i++){
    n *= 10;
    n += s[i]-'0';
  }
  return n;
}

int marume(int n) {
  if(n%5 != 0) n -= n%5;
  if(n%100 == 60) n = n + 100 - 60; 
  return n;
}

int marume2(int n) {
  if(n%5 != 0) n += 5 - n%5;
  if(n%100 == 60) n = n + 100 - 60; 
  return n;
}

int main(){
  bool p[2410];
  fill(p, p+2410, false);
  int n;
  cin >> n;
  for(int i=0; i < n; i++) {
    string s;
    cin >> s;
    int a = sto(s.substr(0, 4)), b = sto(s.substr(5));
    a = marume(a); b = marume2(b);

    for(int j = a; j <= b; j++) p[j] = true;
  }
  bool first = true;
  for(int i=0; i <= 2401; i++) {
    if(p[i] && first){printf("%04d-", i); first = false;}
    if(!p[i] && !first){printf("%04d\n", i-1); first = true;}
  }
}

Submission Info

Judge Result