Submission #112722

---

Source Code Expand

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cstdio>
using namespace std;

int main()
{
	int N;
	cin >> N;
	map<int, int> data;
	for(int i=0; i<N; i++) {
		char buf[10] = "";
		int st,ed;
		cin >> buf;
		sscanf(buf, "%04d-%04d", &st, &ed);
		st -= st % 5;
		if(0 != ed % 5) {
			ed += 5 - (ed % 5);
			if(60 == ed % 100) {
				ed += 40;
			}
		}
		if(0 == data.count(st)) {
			data.insert(make_pair(st,1));
		} else {
			data[st]++;
		}
		if(0 == data.count(ed)) {
			data.insert(make_pair(ed,-1));
		} else {
			data[ed]--;
		}
	}
	map<int, int>::iterator it0 = data.begin();
	int lv = 0;
	vector<pair<int, int> > result;
	pair<int, int> tmp;
	while(it0 != data.end()) {
		if(lv <= 0) {
			lv += it0->second;
			if(it0->second > 0) {
				tmp.first = it0->first;
			}
		} else {
			lv += it0->second;
			if(lv <= 0) {
				tmp.second = it0->first;
				result.push_back(tmp);
			}
		}
		it0++;
	}

	vector<pair<int, int> >::iterator it = result.begin();
	while(it != result.end()) {
		printf("%04d-%04d\n", it->first, it->second);
		it++;
	}
	return 0;
}

Submission Info

Judge Result