Submission #687983

---

Source Code Expand

#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<i_i, int> p_i;

int main() {
  int n;
  cin >> n;
  vector<vector<int>> se(n, vector<int>(2));

  for (int i = 0 ; i < n ; i++) {
    char tmp;
    cin >> se[i][0] >> tmp >> se[i][1];
  }

  bool raining[289];
  for (int i = 0 ; i < 289 ; i++) {
    raining[i] = false;
  }
  for (int i = 0 ; i < n ; i++) {
    int se0 = (se[i][0]/100)*12 + (se[i][0]%100)/5;
    int se1 = (se[i][1]/100)*12 + (se[i][1]%100+4)/5 - 1;
    for (int i = se0 ; i <= se1 ; i++) {
      raining[i] = true;
    }
  }

  for (int i = 0 ; i < 288 ; i++) {
    if (!raining[i]) { continue; }
    int j;
    for (j = i ;  ; j++) {
      if (!raining[j]) { break; }
    }
    printf("%02d%02d-%02d%02d\n", i/12, (i%12)*5, j/12, (j%12)*5);
    i = j;
  }

  return 0;
}

Submission Info

Judge Result