Submission #1120338

---

Source Code Expand

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#define REP(i, N) for(int i = 0; i < N; ++i)
#define REEP(i, N) for(int i = N - 1; i >= 0; --i)
#define ALL(a) (a).begin(),(a).end()
#define FOR(i,m,n) for(int i = m; i < n; ++i)
#define RFOR(i,m,n) for(int i = n - 1; i >= m; --i)
#define CIN(a) cin >> a
#define CIN2(a, b) cin >> a >> b
#define CIN3(a, b, c) cin >> a >> b >> c
#define COUT(a) cout << a << endl
#define COUT2(a, b) cout << a << " " << b << endl
#define COUT3(a, b, c) cout << a << " " << b << " " << c << endl
#define pb push_back
#define PB push_back
#define VINT(v, n) vector<int> v(n); REP(i, n) { v[i] = 0 }
#define VINT2(v, n, m) vector<vector<int> > v(n, vector<int>(m)); REP(i, n) { REP(j, m) { v[i][j] = 0 } }
#define VCHAR(v, n) vector<char>v(n)
#define MAX(a, b) a > b ? a : b
#define MIN(a, b) a < b ? a : b
#define CEIL(c, a, b) if(a % b == 0) { c = a / b;} else { c = a / b + 1;}
#define sp(n) setprecision(n)
#define INF 100000000
#define MOD 100000007

using namespace std;
typedef pair<int, int> P;
int DX[4] = {1, 0, -1, 0};
int DY[4] = {0, 1, 0, -1};

int main() {
	int N;
	CIN(N);
	vector<int> time_table(1442, 0);
	REP(i, N) {
		int s, e;
		string S;
		CIN(S);
		s = 600 * stoi(S.substr(0, 1)) + 60 * stoi(S.substr(1, 1)) + 10 * stoi(S.substr(2, 1)) + stoi(S.substr(3, 1));
		e = 600 * stoi(S.substr(5, 1)) + 60 * stoi(S.substr(6, 1)) + 10 * stoi(S.substr(7, 1)) + stoi(S.substr(8, 1));
		s -= s % 5;
		if(e % 5 != 0) e += 5 - (e % 5);
		time_table[s] += 1;
		time_table[e + 1] -= 1;
	}
	for(int i = 1; i < 1442; ++i) {
		time_table[i] += time_table[i - 1];
	}
	REP(i, 1442) {
		if(i == 0 && time_table[i] != 0) cout << "0000" << '-';
		else if(time_table[i] != 0 && time_table[i - 1] == 0) {
			cout << setw(4) << setfill('0') << 100 * (i / 60) + i % 60 << '-';
		}
		else if (time_table[i] == 0 && time_table[i - 1] != 0) {
			cout << setw(4) << setfill('0') << 100 * ((i - 1) / 60) + (i - 1) % 60  << endl;
		}
	}
}

Submission Info

Judge Result