Submission #108394

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <list>
#include <algorithm>

using namespace std;

void truncateTime(int &h, int &m)
{
	m = m / 5 * 5;
}

void roundUpTime(int &h, int &m)
{
	m = (m + 4) / 5 * 5;
	if (m == 60) {
		++h;
		m = 0;
	}
}

struct range_t
{
	int begH, begM;
	int endH, endM;

	pair<pair<int, int>, pair<int, int> > as_pair() const
	{
		return make_pair(beg_pair(), end_pair());
	}

	pair<int, int> beg_pair() const
	{
		return make_pair(begH, begM);
	}

	pair<int, int> end_pair() const
	{
		return make_pair(endH, endM);
	}

	void end_pair(const pair<int, int> &p)
	{
		endH = p.first;
		endM = p.second;
	}

	bool overlaps(const range_t &other) const
	{
		if (end_pair() < other.beg_pair()) {
			return false;
		}
		if (other.end_pair() < beg_pair()) {
			return false;
		}
		return true;
	}

	bool operator<(const range_t &other) const
	{
		return as_pair() < other.as_pair();
	}

	void print() const
	{
		printf("%02d%02d-%02d%02d\n", begH, begM, endH, endM);
	}
};


int main()
{
	int N;
	cin >> N;

	list<range_t> ranges;
	for (int i = 0; i < N; ++i) {
		char hyphen;
		int S, E;
		cin >> S >> hyphen >> E;

		range_t r;
		r.begH = S / 100;
		r.begM = S % 100;
		truncateTime(r.begH, r.begM);
		r.endH = E / 100;
		r.endM = E % 100;
		roundUpTime(r.endH, r.endM);
		ranges.push_back(r);
	}
	ranges.sort();

	if (ranges.size() >= 2) {
		list<range_t>::iterator it = ranges.begin();
		list<range_t>::iterator prev = it;

		++it;
		while (it != ranges.end()) {
			if (it->overlaps(*prev)) {
				prev->end_pair(max(prev->end_pair(), it->end_pair()));
				it = ranges.erase(it);
			} else {
				prev = it;
				++it;
			}
		}
	}
	for (list<range_t>::const_iterator it = ranges.begin(); it != ranges.end(); ++it) {
		it->print();
	}
}

Submission Info

Judge Result