Submission #813454

---

Source Code Expand

#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <string>
#include <tuple>
#include <utility>

using namespace std;

typedef tuple<int, int, int, int> ti;

bool debug = false;

int main(void){
	int n;
	cin >> n;
	list<ti> t;

	for (int i = 0; i < n; ++i)
	{
		int a, b, c, d;
		string s;
		cin >> s;
		//input format:
		//HHMM-HHMM
		//012345678
		//aabb ccdd
		a = stoi(s.substr(0, 2));
		b = stoi(s.substr(2, 2));
		c = stoi(s.substr(5, 2));
		d = stoi(s.substr(7, 2));
		if (d > 55) {
			++c;
		}
		b = (b/5)*5;
		d = (((d+4)/5)%12)*5;
		t.push_back(ti(a, b, c, d));
	}

	t.sort();

	if (debug)
	{
		for (list<ti>::iterator i = t.begin(); i != t.end(); ++i)
		{
			ti now = *i;
			cout << setfill('0') << right << setw(2) << get<0>(now) <<
			setw(2) << get<1>(now) << "-" << setw(2) << get<2>(now) <<
			setw(2) << get<3>(now) << endl;
		}
	}

	for (list<ti>::iterator i = t.begin(); i != --t.end(); ++i)
	{
		ti current = *i;
		++i;
		ti next = *i;
		--i;
		int endCH = get<2>(current);
		int endCM = get<3>(current);
		int startNH = get<0>(next);
		int startNM = get<1>(next);
		if (endCH > startNH || (endCH == startNH && endCM >= startNM))
		{
			ti merge;
			if (get<2>(next) > get<2>(current)) {
				merge = ti(get<0>(current), get<1>(current), get<2>(next), get<3>(next));
			} else if (get<2>(next) == get<2>(current)) {
				if (get<3>(next) > get<3>(current)) {
					merge = ti(get<0>(current), get<1>(current), get<2>(next), get<3>(next));
				} else {
					merge = ti(get<0>(current), get<1>(current), get<2>(current), get<3>(current));
				}
			} else {
				merge = ti(get<0>(current), get<1>(current), get<2>(current), get<3>(current));
			}
			i = t.insert(i, merge);
			++i;
			i = t.erase(i);
			i = t.erase(i);
			--i;
			--i;
		}
	}

	for (list<ti>::iterator i = t.begin(); i != t.end(); ++i)
	{
		ti now = *i;
		cout << setfill('0') << right << setw(2) << get<0>(now) <<
		setw(2) << get<1>(now) << "-" << setw(2) << get<2>(now) <<
		setw(2) << get<3>(now) << endl;
	}

	return 0;
}

Submission Info

Judge Result