Submission #1177631

---

Source Code Expand

#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string>
#include<iostream>
#include<cctype>
#include<cstdio>
#include<vector>
#include<stack>
#include<queue>
#include <algorithm>
#include<math.h>
#include<set>
#include<map>
#include<iomanip>

//#include<bits/stdc++.h>


using namespace std;

int f[1500];

int main() {
	
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		string p;
		cin >> p;
		int x = p[0] - '0',y=p[1]-'0',t=p[2]-'0',d=p[3]-'0';
		x *= 10;
		x += y;
		x *= 60;
		int w = (t * 10 + d);
	//if ((t * 10 + d) % 5)w++;
		x += w ;
		x -= w % 5;
	//	x -= w % 5;
		f[x] += 1;
		 x = p[5] - '0', y = p[6] - '0', t = p[7] - '0', d = p[8] - '0';
		x *= 10;
		x += y;
		x *= 60;
		 w = (t * 10 + d) ;
		 if ((t * 10 + d) % 5)w+=5-w%5;
		x += w ;
	//	if(x%5)x +=5- w % 5;
	//	cout << x << endl;
		f[x ] += -1;


	}

	for (int i = 0; i < 1480; i++) {
		f[i + 1] += f[i];
	}
	bool q = 0;
	for (int i = 0; i < 1480; i+=5) {

		if (f[i]) {
			if (!q) {
				if (i == 0)cout << "0000-" ;
				else {
					if (i < 600)cout << 0;
					if (i < 60)cout << 0;
					//if (i < 10)cout << 0;
					else cout << i / 60;
					if (i % 60 < 10)cout << 0;
				//	int y = i % 5;
					cout << i % 60  << '-';
				}
				q = 1;
			}
		}
		else {
			if (q) {
				if (i == 0)cout << "0000" << endl;
				else {
					if (i < 600)cout << 0;
					if (i < 60)cout << 0;
					//if (i < 10)cout << 0;
					else cout << i / 60;
					int y = i % 5;
					if (i % 60 < 10)cout << 0;
				//	if (y)i += 5 - y;
					cout << i % 60 << endl;;
				//	cout << "%" << i;
				}
				q = 0;
				
			}
		}
	}


	return 0;

}

Submission Info

Judge Result