Submission #141483

---

Source Code Expand

#include <iostream>
#include <string.h>
#include <vector>

using namespace std;

void solve()
{
	bool flag[2500];
	memset(flag, 0, sizeof(flag));
	int N;
	cin >> N;
	vector<int> S(N);
	char c;
	vector<int> E(N);
	for(int i = 0; i < N; ++i)
	{
		cin >> S[i] >> c >> E[i];
	}
	for(int i = 0; i < N; ++i)
	{
		if(S[i] % 5 != 0)
		{
			S[i] -= (S[i] % 5);
		}
		if(E[i] % 5 != 0)
		{
			E[i] += (5 - E[i] % 5);
			if(E[i] % 100 == 60)
			{
				E[i] += 40;
			}
		}
		for(int j = S[i]; j <= E[i]; ++j)
		{
			flag[j] = true;
		}
	}
	for(int i = 0; i <= 2400; ++i)
	{
		if(flag[i])
		{
			int start = i;
			while(i <= 2400 && flag[i])
			{
				++i;
			}
			int end = i - 1;

			int count = 0;
			int buf = start;
			do
			{
				buf /= 10;
				++count;
			}while(buf);
			for(int j = 0; j < 4 - count; ++j)
			{
				cout << "0";
			}
			cout << start << "-";
			buf = end;
			count = 0;
			do
			{
				buf /= 10;
				++count;
			}while(buf);
			for(int j = 0; j < 4 - count; ++j)
			{
				cout << "0";
			}
			cout << end << endl;
		}
	}
}

int main()
{
	solve();
	return(0);
}

Submission Info

Judge Result