Submission #1351694

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
template<class T>bool chmin(T&a,const T&b){return a>b?(a=b,true):false;}
template<class T>bool chmax(T&a,const T&b){return a<b?(a=b,true):false;}

typedef pair<int,int> P;

int toi(int x) {
  return (x / 100) * 60 + (x % 100);
}

string tos(int x) {
  char buf[128];
  sprintf(buf, "%02d%02d", x/60, x % 60);
  return string(buf);
}
int main2() {
  int N;
  cin >> N;

  vector<P> v;

  REP(i, N) {
    int a, b;
    char dummy;
    cin >> a;
    cin >> dummy;
    cin >> b;
    a = a / 5 * 5;
    b = (b + 4) / 5 * 5;
    v.push_back( make_pair(toi(a), toi(b)) );
  }
  sort(v.begin(), v.end(), [](const P& a, const P& b){
    if (a.first != b.first) 
      return a.first < b.first;
    return a.second < b.second;
  });

  vector<P> w;
  REP(i, v.size()) {
    if (w.empty())
      w.push_back(v[i]);
    else {
      if (w.back().second >= v[i].first) {
        chmax(w.back().second, v[i].second);
      }
      else {
        w.push_back(v[i]);
      }
    }
  }
  REP(i, w.size()) {
    cout << tos(w[i].first) << "-" << tos(w[i].second) << endl;
  }
  return 0;
}

int main() {
  for (;!cin.eof();cin>>ws) main2();
  return 0;
}

Submission Info

Judge Result