Submission #1498702


Source Code Expand

#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>

using namespace std;

#ifndef _DEBUG
#define main_ main
#endif
#define FOR(i,s,e) for (int i = int(s); i < int(e); ++i)
#define REP(i,e) FOR(i,0,e)
#define INF (INT_MAX/2)
#define EPS (1.0e-8)
#define LINF (LONG_MAX/2)

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<string> vs;

template <typename T>
using keyVal = pair<string, T>;
template<typename T>
bool val_greater(const keyVal<T>& left, const keyVal<T>& right) {
	return left.second > right.second;
}

vs split(string str, char sep) {
	vs v; stringstream ss(str); string t;
	while (getline(ss, t, sep)) v.push_back(t);
	return v;
}

void init_global() {}

int main_() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N; cin >> N;
	vi S, E;
	string t;
	FOR(i, 0, N) {
		cin >> t;
		int s = stoi(t.substr(0, 2)) * 60 + stoi(t.substr(2, 2));
		s -= s % 5;
		S.push_back(s);

		int e = stoi(t.substr(5, 2)) * 60 + stoi(t.substr(7, 2));
		if (e % 5 != 0) e += (5 - e%5);		
		E.push_back(e);
	}

	const int XMAX = 60*24+1;
	vi x(XMAX+4, 0);
	FOR(i, 0, N) {
		x[S[i]]++;
		x[E[i]]--;
	}

	FOR(i, 0, XMAX) {
		x[i + 1] += x[i];
	}

	FOR(i, 0, XMAX) {
		int s;
		if (x[i] > 0) s = i;
		else continue;

		int j = s;
		while (x[j] > 0) j++;			
		int e = j;
		
		printf("%02d%02d-%02d%02d\n", 
			s / 60, s % 60, e / 60, e % 60);

		i = j;
	}
	return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User apprec
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1674 Byte
Status AC
Exec Time 16 ms
Memory 640 KB

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 48
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, cho_cho_chokudai.txt, chokudai_ga_cho.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
cho_cho_chokudai.txt AC 15 ms 640 KB
chokudai_ga_cho.txt AC 15 ms 640 KB
test_01.txt AC 1 ms 256 KB
test_02.txt AC 1 ms 256 KB
test_03.txt AC 1 ms 256 KB
test_04.txt AC 1 ms 256 KB
test_05.txt AC 1 ms 256 KB
test_06.txt AC 1 ms 256 KB
test_07.txt AC 1 ms 256 KB
test_08.txt AC 1 ms 256 KB
test_09.txt AC 2 ms 256 KB
test_10.txt AC 2 ms 256 KB
test_11.txt AC 2 ms 256 KB
test_12.txt AC 1 ms 256 KB
test_13.txt AC 1 ms 256 KB
test_14.txt AC 2 ms 256 KB
test_15.txt AC 2 ms 256 KB
test_16.txt AC 1 ms 256 KB
test_17.txt AC 2 ms 256 KB
test_18.txt AC 1 ms 256 KB
test_19.txt AC 1 ms 256 KB
test_20.txt AC 1 ms 256 KB
test_21.txt AC 15 ms 640 KB
test_22.txt AC 15 ms 640 KB
test_23.txt AC 15 ms 640 KB
test_24.txt AC 15 ms 640 KB
test_25.txt AC 15 ms 640 KB
test_26.txt AC 16 ms 640 KB
test_27.txt AC 16 ms 640 KB
test_28.txt AC 15 ms 640 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 3 ms 384 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 11 ms 512 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 15 ms 640 KB
test_37.txt AC 15 ms 640 KB
test_38.txt AC 15 ms 640 KB
test_39.txt AC 15 ms 640 KB
test_40.txt AC 15 ms 640 KB
test_41.txt AC 14 ms 640 KB
test_42.txt AC 16 ms 640 KB
test_43.txt AC 15 ms 640 KB