Submission #468033

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;

#define rep(i,n) for(int i=0; i<(n); i++)
#define repc(i,s,e) for(int i=(s); i<(e); i++)
#define pb(n) push_back((n))
#define mp(n,m) make_pair((n),(m))
#define all(r) r.begin(),r.end()
#define fi first
#define se second

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;


int n;
vector<pair<double, double> > v;


int getRound(int a) {
	for (int i = a - 4; i < a; i++) {
		if (i % 5 == 0) {
			a = i;
			break;
		}
	}
	if (a < 0)a *= (-1);
	if (a % 100 == 60) {
		a /= 100;
		a++;
		a *= 100;
	}
	return a;
}


int main(){
	int n;
	vector<pair<int, int> > v;
	cin >> n;
	for (int i = 0; i < n; i++) {
		int a, b;
		cin >> a >> b;
		//cout << a << " " << b << endl;
		v.push_back(mp(getRound(a), getRound(b)));
		//cout << v[i].first << " " << v[i].second << endl;
	}
	sort(all(v));
	int s = v[0].first, e = v[0].second;
	for (int i = 0; i < n; i++) {
		if (e >= v[i].first) {
			if (e < v[i].second) {
				e = v[i].second;
			}
		}
		else {
			//cout << s << "-" << e << endl;
			printf("%04d-%04d\n", s, e);
			s = v[i].first;
			e = v[i].second;
		}
	}
	printf("%04d-%04d\n", s, e);
}

Submission Info

Judge Result