Submission #3818108

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.rbegin(), v.rend());//vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;

int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  int r_size = 24*12 + 1;
  int r[r_size] = {};

  int n;
  cin >> n;

  REP(i,n){
    int s,e;
    cin >> s >> e;
    e = -e;

    s = s/5 *5;
    if(e %5 !=0) e = e/5 * 5 + 5;

    int ps = (s/100) * 12 + (s%100)/5;
    int pe = (e/100) * 12 + (e % 100) /5;
    for(int t=ps; t<pe; t++) r[t] = 1;

  }

  for(int t=0,l=0;t<r_size;l=r[t++]){
    //HHmm
    int time = (t/12) * 100 + (t%12) * 5;

    if(l==0 && r[t] == 1) cout << setfill('0') << setw(4) << time << "-";
    else if(l==1 && r[t] == 0) cout << setfill('0') << setw(4) << time << endl;
  }
}

Submission Info

Judge Result