Submission #2117382

---

Source Code Expand

#include "bits/stdc++.h"

using namespace std;
using ll = long long;
using IP = pair<int, int>;

const ll linf = 1LL << 62;
const int inf = 99999999;
const int dx[4] = { 1,0,-1,0 };
const int dy[4] = { 0,1,0,-1 };
const ll atcoder = 1e9 + 7;

#define Endl endl
#define mp make_pair
#define all(v) v.begin(),v.end()
#define pb push_back
#define pr(x) cout << x << endl
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
#define rep(i,n) for(int i= 0;i<n;i++)

template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
	std::fill((T*)array, (T*)(array + N), val);
}

ll gcd(ll a, ll b) {//最大公約数
	if (a < b)swap(a, b);
	if (a%b == 0)return b;
	else gcd(b, a%b);
}

ll lcm(ll a, ll b) {//最小公倍数
	if (a < b)swap(a, b);
	return (a / gcd(a, b))*b;
}

int main() {

	int imos[300] = { 0 };
	int n;
	cin >> n;

	rep(i,n) {
		int x, y;
		char c;
		cin >> x >> c >> y;
		x -= x % 5;
		if (y % 5 != 0) y += 5 - (y % 5);
		imos[12 * (x / 100) + (x % 100) / 5]++;
		imos[12 * (y / 100) + (y % 100) / 5]--;
	}

	for (int i = 1; i < 289; i++) imos[i] += imos[i - 1];

	for (int i = 0; i < 288; i++) {
		if (imos[i]) {
			int f = i;
			while (imos[i] && i <= 288) i++;
			printf("%02d%02d-%02d%02d\n", f / 12, f % 12 * 5, i / 12, i % 12 * 5);
		}
	}

	//system("pause");
	return 0;
}

Submission Info

Judge Result