Submission #1119849

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<map>
#include<numeric>
#include<queue>
#include<string>
#include<sstream>

using namespace std;

vector< pair<int, int> > trans(vector<string> s){
  vector< pair<int, int> > p(s.size());
  for(int i=0; i<s.size(); i++){
    p[i].first = 1000 * (s[i][0]-'0') + 100 * (s[i][1]-'0') + 10 * (s[i][2]-'0') + (s[i][3]-'0');
    p[i].second = 1000 * (s[i][5]-'0') + 100 * (s[i][6]-'0') + 10 * (s[i][7]-'0') + (s[i][8]-'0');
  }
  return p;
}

vector< pair<int, int> > round5(vector< pair<int, int> > p){
  for(int i=0; i<p.size(); i++){
    if( p[i].first % 10 >= 5 ) p[i].first = (p[i].first / 10) * 10 + 5;
    else p[i].first = (p[i].first / 10) * 10;

    if( p[i].second % 10 > 5 ) p[i].second = ( p[i].second / 10 + 1) * 10;
    else if( p[i].second % 10 != 0 ) p[i].second = (p[i].second / 10) * 10 + 5;

    if( p[i].second % 100 == 60 ){
      p[i].second += 40;
    }
  }
  return p;
}

int main(void) {

  int n;
  cin >> n;
  vector<string> s(n);
  for(int i=0; i<n; i++) cin >> s[i];

  vector< pair<int, int> > p = round5( trans(s) );
  // sort(p.begin(), p.end());
  cerr << endl;
  vector<bool> b(2600, false);
  for(int i=0; i<p.size(); i++){
    cerr << p[i].first << " " << p[i].second << endl;
    for(int j=p[i].first; j<=p[i].second; j++) b[j] = true;
  }
  cerr << endl;

  bool w = false;
  int ss = 0;
  int ee = 0;
  for(int i=0; i<2600; i++){
    if( b[i] ){
      if( !w ) ss = i;
      w = true;
    }else{
      if( !w ) continue;
      else{
        ee = i-1;
        string sstr = to_string(ss);
        while( sstr.size() != 4 ) sstr = '0' + sstr;
        string estr = to_string(ee);
        while( estr.size() != 4 ) estr = '0' + estr;

        cout << sstr << "-" << estr << endl;
        w = false;
      }
    }
  }


  return 0;
}










//

Submission Info

Judge Result