Submission #108052

---

Source Code Expand

#include<deque>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<numeric>
#include<cmath>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
  int i, j;
  int n;
  cin >> n;
  pair<string, string> a[30000];
  for(i = 0; i < n; ++i) {
    string s;
    cin >> s;
    a[i].first = s.substr(0, 4);
    a[i].second = s.substr(5, 4);
    a[i].first[3] = a[i].first[3] >= '5' ? '5' : '0';
    if(false) {
    } else if(a[i].second[3] == '0') {
    } else if(a[i].second[3] <= '5') {
      a[i].second[3] = '5';
    } else {
      if(a[i].second[2] == '5') {
        if(a[i].second[1] == '9') {
          ++a[i].second[0];
          a[i].second[1] = '0';
        } else {
          ++a[i].second[1];
        }
        a[i].second[2] = '0';
      } else {
        ++a[i].second[2];
      }
      a[i].second[3] = '0';
    }
  }
  sort(a, a + n);
  for(i = 0; i < n; i = j) {
    string mx = a[i].second;
    for(j = i + 1; j < n; ++j) {
      if(mx >= a[j].first) {
        mx = max(mx, a[j].second);
      } else {
        break;
      }
    }
    cout << a[i].first << '-' << mx << endl;
  }
  return 0;
}

Submission Info

Judge Result