Submission #1690793

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <climits>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <sstream>
#include <vector>
#include <map>
#include <set>
#include <complex>
#include <functional>
#include <utility>
#include <iterator>

#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for(int i = (m); i < (int)(n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define INF 2000000000

#ifdef LOCAL
  #define eprintf(...) fprintf(stdout, __VA_ARGS__)
#else
  #define eprintf(...) 0
#endif

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef unsigned int uint;

const double PI = 3.1415926535897932384626433832795;

// split a string to vector<string>
std::vector<std::string> split(const std::string &str, char delim) {
  std::istringstream stream(str);
  std::string element;
  std::vector<std::string> result;
  while(std::getline(stream, element, delim)) {
    result.push_back(element);
  }
  return result;
}

int main() {
  int n;
  cin >> n;
  string s;
  map<int, int> mp;
  REP(i, n) {
    cin >> s;
    vector<string> se = split(s, '-');
    int start = atoi(se[0].c_str());
    int end = atoi(se[1].c_str());
    start = start - (start % 5);
    end = end % 5 == 0 ? end : end + (5 - end % 5);
    mp[start]++;
    mp[end]--;
  }

  //int raining = 0;
  int sum = 0;
  bool raining = false;
  string str;
  for(auto m : mp) {
    sum += m.second;
    eprintf("  %d:%d sum:%d\n", m.first, m.second,sum);
    if(!raining && sum > 0) {
      char buff[5];
      sprintf(buff, "%04d", m.first);
      //str = to_string(m.first);
      str = string(buff);
      raining = true;
    }
    else if(raining && sum <= 0) {
      char buff[5];
      sprintf(buff, "%04d", m.first);
      //str += "-" + to_string(m.first);
      str += "-" + string(buff);
      cout << str << endl;
      raining = false;
    }
  }

  return 0;
}

Submission Info

Judge Result