Submission #139575

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <sstream>
#include <vector>
#include <string>
#include <iomanip>
#define INF	100000000
using namespace std;
typedef pair<int, int> P;

int main(){
	bool a[288];
	int n;
	for(int i = 0; i < 288; i++){
		a[i] = false;
	}
	cin >> n;
	for(int i = 0; i < n; i++){
		int p, q;
		char trash;
		cin >> p >> trash >> q;
		p = p/100*12+(p%100)/5;
		if(q%100 == 0) q = q/100*12;
		else q = q/100*12+((q%100)-1)/5+1;
		for(int i = p; i < q; i++){
			a[i] = true;
		}
	}
	bool hata = false;
	for(int i = 0; i < 288; i++){
		if(i == 0 && a[i] == true){
			hata = true;
			cout << "0000-";
		}
		else if(a[i] == true && hata == false){
			hata = true;
			if(i/12 < 10) cout << "0";
			cout << i/12;
			if((i%12)*5 < 10) cout << "0";
			cout << (i%12)*5 << "-";
			if(i == 287) cout << "2400" << endl;
		}
		else if(a[i] == false && hata == true){
			hata = false;
			if(i/12 < 10) cout << "0";
			cout << i/12;
			if((i%12)*5 < 10) cout << "0";
			cout << (i%12)*5 << endl;
		}
		else if(a[i] == true && i == 287){
			cout << "2400" << endl;
		}
	}
}

Submission Info

Judge Result