Submission #678619

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> P;

int f(string s) {
	int a = (s[0] - '0') * 10 + (s[1] - '0');
	int b = (s[2] - '0') * 10 + (s[3] - '0');
	return a * 60 + b;
}

string g(int x) {
	stringstream ss;

	if(x / 60 < 10) {
		ss << 0;
	}
	ss << x / 60;

	if(x % 60 < 10) {
		ss << 0;
	}
	ss << x % 60;
	return ss.str();
}

vector<string> split(const string &str, char delim) {
	vector<string> res;
	size_t current = 0, found;
	while((found = str.find_first_of(delim, current)) != string::npos) {
		res.push_back(string(str, current, found - current));
		current = found + 1;
	}
	res.push_back(string(str, current, str.size() - current));
	return res;
}

bool used[24 * 60 + 65];

int main() {
	int n;
	cin >> n;

	memset(used, 0, sizeof(used));

	rep(i, n) {
		string s;
		cin >> s;

		vector<string> ret = split(s, '-');
		int a = f(ret[0]);
		a -= a % 5;
		int b = f(ret[1]);
		if(b % 5 != 0) {
			b -= b % 5;
			b += 5;
		}

		REP(j, a, b+1) {
			used[j] = true;
		}
	}

	bool s = true;
	rep(i, 24*60 + 65) {
		if(used[i]) {
			int a = i, b = i;
			REP(j, i, 24*60 + 65) {
				if(used[j]) {
					b = j;
					i++;
				} else break;
			}

			cout << g(a) << "-" << g(b) << endl;
		}
	}

	return 0;
}

Submission Info

Judge Result