Submission #3358935

---

Source Code Expand

#include <iostream>
#include <math.h>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>
#include <iomanip>
#include <string.h>

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()

typedef long long lint;

using namespace std;

int main(){
  int N;
  cin>>N;
  int L=24*12+2;
  int ims[L];
  REP(i,L)ims[i]=0;
  REP(i,N){
    string s;
    cin>>s;
    int start=stoi(s.substr(0,2))*60+stoi(s.substr(2,2));
    int end=stoi(s.substr(5,2))*60+stoi(s.substr(7,2));
    start=start/5;
    end=(end-1)/5+1;
    ims[start]++;
    ims[end]--;
  }
  if(ims[0]>0){
  cout<<"0000-";
  }
  FOR(i,1,L){
    ims[i]+=ims[i-1];
    if(ims[i-1]==0 and ims[i]>0){
      cout<<setfill('0')<<setw(2)<<right;
      cout<<i/12;
      cout<<setfill('0')<<setw(2)<<right;
      cout<<(i%12)*5<<"-";
    }
    if(ims[i-1]>0 and ims[i]==0){
      cout<<setfill('0')<<setw(2)<<right;
      cout<<i/12;
      cout<<setfill('0')<<setw(2)<<right;
      cout<<(i%12)*5<<endl;
    }
  }
  return 0;
}

Submission Info

Judge Result