Submission #408387

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <algorithm>

using namespace std;

int main() {
	int N;
	string str;
	bool rainy[2401];
	
	for (int i = 0; i <= 2400; i += 5) rainy[i] = false;
	
	cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> str;
		int t1 = 0;
		int t2 = 0;
		
		t1 += (str[0] - '0') * 1000;
		t1 += (str[1] - '0') * 100;
		t1 += (str[2] - '0') * 10;
		t1 += (str[3] - '0');
		t2 += (str[5] - '0') * 1000;
		t2 += (str[6] - '0') * 100;
		t2 += (str[7] - '0') * 10;
		t2 += (str[8] - '0');
		
		while (t1 % 5) t1--;
		while (t2 % 5) t2++;
		
		if ((t2 / 10) % 10 == 6) t2 += 40;
		
		for (int j = t1; j < t2; j += 5) {
			rainy[j] = true;
		}
	}
	
	bool flag = false;
	for (int i = 0; i <= 2400; i += 5) {
		if (rainy[i] && !flag) {
			flag = true;
			if (i < 1000) cout << "0";
			if (i < 100) cout << "0";
			if (i < 10) cout << "0";
			cout << i << "-";
		} else if (!rainy[i] && flag) {
			flag = false;
			if (i < 1000) cout << "0";
			if (i < 100) cout << "0";
			if (i < 10) cout << "0";
			cout << i << endl;
		} else if (i == 2400 && flag) {
			cout << "2400" << endl;
		}
	}
	
	return 0;
}

Submission Info

Judge Result