Submission #1150384

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#define REP(i,n) for (int i=0;i<(n);i++)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

using namespace std;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
	int n;
	cin >> n;
	int TIME = 2400;
	vector<int> time(TIME+1,0);
	string s;
	REP(i,n){
		cin >> s;
		int start = atoi(s.substr(0,4).c_str())
			,end = atoi(s.substr(5,4).c_str());
		time[start - start%5]++;
		if(end%5 == 0)time[end]--;
		else time[end + (5-end%5)]--;
	}
	bool rained = false;
	int ct = 0;
	REP(i,TIME+1){
		if(i%100 == 60){
			if(time[i] != 0) time[i+40] += time[i];
			i+=39;
			continue;
		}
		ct += time[i];
		if(ct > 0 && !rained){
			rained = true;
			cout << setfill('0') << setw(4) << i;			
		}else if(rained && ct <= 0){
			rained = false;
			cout << '-';
			cout << setfill('0') << setw(4) << i << endl;
		}

	}
  return 0;
}

Submission Info

Judge Result