Submission #2072904

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <string> 
#include <cmath>  
#include <cstdlib>
#include <ctime>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <functional>

using namespace std;
using ll = long long;

#define FOR(i, m, n) for(int i = (m);i < (n);i++)
#define REP(i,n) for(int i = 0; i < int(n); i++)
#define VI vector<int>
#define VVI vector<vector<int>>
#define VVVI vector<vector<vector<int>>>
#define VL vector<ll>
#define VVL vector<vector<ll>>
#define VB vector<bool>
#define VVB vector<vector<bool>>
#define PAIR pair<int,int>
#define MP make_pair
#define VP vector<pair<int,int>>
#define VS vector<string>
#define QUE queue<int>
#define DEQ deque<int>
#define PQUE priority_queue<int> //5,5,4,3,3,2,...
#define REPQUE priority_queue<int, vector<int>, greater<int>> //1,1,2,3,4,4,5,...
#define SUM(obj) accumulate((obj).begin(), (obj).end(), 0)
#define SORT(obj) sort((obj).begin(), (obj).end()) // 1,2,3,4,5...
#define RESORT(obj) sort((obj).begin(), (obj).end(), greater<int>()) // 5,4,3,2,1...
#define UB(obj,n) upper_bound((obj).begin(), (obj).end(), n) //itr > n
#define LB(obj,n) lower_bound((obj).begin(), (obj).end(), n) //itr>= n

const ll MOD = (ll)1e9 + 7;

int main() {
	int N;
	cin >> N;
	VI T(24 * 24 + 4,0);
	REP(i, N) {
		string str;
		cin >> str;
		
		string strSh = (str[0] != '0') ? str.substr(0, 2) : str.substr(1, 1);
		int Sh = stoi(strSh);
		
		string strSm = (str[2] != '0') ? str.substr(2, 2) : str.substr(3, 1);
		int Sm = stoi(strSm);
		Sm -= (Sm % 5);
		Sm = int(Sm/2.5);

		string strEh = (str[5] != '0') ? str.substr(5, 2) : str.substr(6, 1);
		int Eh = stoi(strEh);
		
		string strEm = (str[7] != '0') ? str.substr(7, 2) : str.substr(8, 1);
		int Em = stoi(strEm);
		if (55 < Em && Em <= 59) {
			Eh++;
			Em = 0;
		}
		Em += (Em % 5 == 0) ? 0 : (5 - (Em % 5));
		Em = int(Em/2.5);

		T[Sh * 24 + Sm]++;
		T[Eh * 24 + Em + 1]--;
	}

	

	REP(i, 24 * 24 + 2) T[i + 1] += T[i];

	//REP(i, 24 * 24 + 2) {
	//	if ((i / 24) < 10) cout << 0;
	//	cout << (i / 24);
	//	if ((i % 24) < 4) cout << 0;
	//	cout << int((i % 24)*2.5) << " ";
	//	cout << T[i] << " " << i << endl;
	//}

	bool flag = false;
	REP(i, 24 * 24 + 2) {
		
		if (T[i] > 0 && !flag) {
			if ((i / 24) < 10) cout << 0;
			cout << (i / 24);
			if ((i % 24) < 4) cout << 0;
			cout << int((i % 24)*2.5) << "-";
			flag = true;
		}

		if (T[i + 1] == 0 && flag) {
			if ((i / 24) < 10) cout << 0;
			cout << (i / 24);
			if ((i % 24) < 4) cout << 0;
			cout << int((i % 24) * 2.5) << endl;
			flag = false;
		}

	}
	
	//cin >> N;
	return 0;
}

Submission Info

Judge Result