Submission #860819

---

Source Code Expand

#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <climits>
#include <cstdlib>
#include <vector>
//#include <unordered_map> 
#include <iomanip>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF (INT_MAX/3)
#define PSB push_back
#define PN 1000000007
typedef long long LL;
//#define int long long


//booooooooooooost
//#include <boost/multiprecision/cpp_int.hpp>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//namespace mp = boost::multiprecision;	//多倍長整数(mp::cpp_int), 多倍長小数(mp::cpp_dec_float_100)



LL inv_mod(LL a, LL m)
{
	LL b, x, u, q, tmp;

	b = m; x = 1; u = 0;
	while (b > 0) {
		q = a / b;
		tmp = u; u = x - q * u; x = tmp;
		tmp = b; b = a - q * b; a = tmp;
	}

	return (x < 0) ? m + x : x;
}



bool comp(pair<int, int> x, pair<int, int> y) {
	return x.first < y.first;
}

signed main() {

	int N;
	vector<pair<int, int> > T;
	cin >> N;
	REP(i, N) {
		string s;
		cin >> s;
		T.PSB(pair<int, int>(atoi(s.substr(0, 4).c_str()), atoi(s.substr(5, 4).c_str())));
	}

	REP(i, N) {
		T[i].first = T[i].first - (T[i].first % 10) % 5;
		T[i].second = T[i].second + 4;
		T[i].second = T[i].second - (T[i].second % 10) % 5;
		if (T[i].second % 100 == 60) T[i].second = (T[i].second / 100 + 1) * 100;
	}
	sort(ALL(T), comp);
	vector<pair<int, int> > anss;
	anss.PSB(T[0]);
	FOR(i, 1, N) {
		if (T[i].first <= anss.back().second) anss.back().second = max(anss.back().second, T[i].second);
		else anss.PSB(T[i]);
	}
	
	REP(i, anss.size()) {
		cout << setw(4) << setfill('0') << anss[i].first;
		cout << "-";
		cout << setw(4) << setfill('0') << anss[i].second;
		cout << endl;
	}

	return 0;
}

Submission Info

Judge Result