Submission #1714028

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <sstream>
#include <climits>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
#include <iterator>
#include <bitset>
#include <random>
//#include "util.h"

using namespace std;
typedef unsigned uint;
typedef long long lint;
typedef unsigned long long ulint;



//呪文
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { cout << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { cout << "{ }"; return ostr; } cout << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { cout << "{ }"; return ostr; }	cout << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { cout << "{ }"; return ostr; } cout << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
//template <typename T> void print(T* v, int N) { if (N == 0) cout << "{ }"; cout << "{" << v[0]; for (int i = 1; i < N; i++) cout << ", " << v[i]; cout << "}"; }
#define PI 3.14159265358979323846
#define EPS 1e-8
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()



typedef pair<int, int> pii;

bool table[1440 + 1];

int problemD()
{
	int N;
	cin >> N;

	string S;
	int s, t;
	for (int i = 0; i < N; i++) {
		cin >> S;
		s = stoi(S.substr(0, 4));
		t = stoi(S.substr(5, 4));
		s = s / 100 * 60 + s % 100 / 5 * 5;
		t = t / 100 * 60 + t % 100 / 5 * 5 + (t % 5 ? 5 : 0);
		
		for (int u = s; u <= t; u++) table[u] = true;
	}

	vector<pii> ans;
	for (int i = 0; i <= 1440; i++) {
		if (table[i]) {
			int j = i;
			while (j < 1440 && table[j + 1]) j++;
			ans.push_back(pii(i, j));
			i = j;
		}
	}

	for (int i = 0; i < ans.size(); i++) {
		int bh, bm, eh, em;
		bh = ans[i].first / 60;
		bm = ans[i].first % 60;
		eh = ans[i].second / 60;
		em = ans[i].second % 60;
		printf("%02d%02d-%02d%02d\n", bh, bm, eh, em);
	}

	return 0;
}


int main()
{
	//clock_t start, end;
	//start = clock();

	problemD();

	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}

Submission Info

Judge Result