Submission #515867

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring> 
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>

using namespace std;

int main()
{
	int n;
	cin >> n;
	int t[24 * 60 + 1] = {};
	char ch;
	int tmp, hour, minutes;
	for(int i = 0; i < n; i++){
		cin >> tmp;
		// 条件を満たすように丸める 降り終わりのときだけ分が60になる可能性があるのでそこをなおす
		hour = tmp / 100;
		minutes = tmp % 100;
		minutes -= minutes % 5;
		t[hour * 60 + minutes]++;
		cin >> ch;
		cin >> tmp;
		hour = tmp / 100;
		minutes = tmp % 100;
		if(minutes % 5 != 0) minutes += (5 - minutes % 5);
		if(minutes >= 60){
			hour++;
			minutes = minutes % 60;
		}
		t[hour * 60 + minutes]--;
	}
	int flag = 0;
	for(int i = 0; i < 24 * 60 + 1; i++){
		if(i != 0) t[i] += t[i - 1];
		if((t[i] > 0 && flag == 0) || (t[i] == 0 && flag == 1)){
			hour = i / 60;
			minutes = i % 60;
			int ans = hour * 100 + minutes;
			if(t[i] > 0){
				printf("%4d", ans);
				flag = 1;
			}
			else{
				printf("-%4d\n", ans);
				flag = 0;
			}
		}
	}
	return 0;
}

Submission Info

Judge Result