Submission #108886

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <complex>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cctype>
#include <cassert>
#include <cstring>
using namespace std;

#define REP(i, x, n) for(int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define f first
#define s second
#define mp make_pair
#define pb push_back

typedef pair<string, string> P;
typedef long long lli;

static const int INF = (1 << 29);
static const double EPS = 1e-9;
static const double PI = acos(-1.0);

vector<P> ans, t;

void solve() {
  rep(i, t.size()) {
    if(t[i].f[3] < '5') t[i].f[3] = '0';
    else t[i].f[3] = '5';
    
    if(t[i].s[3] == '0');
    else if(t[i].s[3] <= '5') t[i].s[3] = '5';
    else {
      t[i].s[3] = '0';
      if(t[i].s[2] == '5') {
        t[i].s[2] = '0';
        if(t[i].s[1] == '9') {
          t[i].s[1] = '0';
          t[i].s[0]++;
        }
        else t[i].s[1]++;
      }
      else {
        t[i].s[2]++;
      }
    }
  }

  sort(t.begin(), t.end());
  
  string bef = "";
  string a, b;
  rep(i, t.size()) {
    a = t[i].f;
    b = t[i].s;
    if(i && a <= bef) continue;
    rep(j, t.size()) {
      if(a <= t[j].f && t[j].f <= b) {
        b = max(b, t[j].s);
      }
    }
    ans.push_back(P(a, b));
    bef = b;
  }
}

int main() {
  int n;
  cin >> n;

  rep(i, n) {
    string a, b, str;
    cin >> str;
    a = str.substr(0, 4);
    b = str.substr(5);
    t.push_back(P(a, b));
  }
  
  solve();

  rep(i, ans.size()) {
    cout << ans[i].f << '-' << ans[i].s << endl;
  }

  return 0;
}

Submission Info

Judge Result