Submission #1134833


Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"

using namespace std;
const long long int MOD = 1000000007;

int N;
char record[10];
int s, e;
bool flag[289];
int num;
int l[300], r[300];
bool box;

int main() {
	cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> record;
		s = (record[0] - '0') * 600;
		s += (record[1] - '0') * 60;
		s += (record[2] - '0') * 10;
		s += (record[3] - '0');
		s -= s % 5;
		e = (record[5] - '0') * 600;
		e += (record[6] - '0') * 60;
		e += (record[7] - '0') * 10;
		e += (record[8] - '0');
		e += 4;
		e -= e % 5;
	//	cout << s << " " << e << endl;
		for (int j = s / 5; j < e / 5; j++) {
			flag[j] = true;
		}
	}
	for (int i = 0; i < 289; i++) {
		if(flag[i]&&!box){
			box = true;
			l[num] = (i*5)%60+(i*5*100/60)/100*100;
		//	cout << "l " << i << " " << l[num] << endl;
		}
		if (!flag[i] && box) {
			box = false;
			r[num++]= (i * 5) % 60 + (i * 5 * 100 / 60)/100*100;
		//	cout << "r " << i << " " << r[num-1] << endl;
		}
	}
	for (int i = 0; i < num; i++) {
		if (l[i] < 1000) {
			if (l[i] < 100) {
				if (l[i] < 10) {
					cout << "000" << l[i];
				}
				else {
					cout << "00" << l[i];
				}
			}
			else {
				cout << "0" << l[i];
			}
		}
		else {
			cout << l[i];
		}
		cout << "-";
		if (r[i] < 1000) {
			if (r[i] < 100) {
				if (r[i] < 10) {
					cout << "000" << r[i];
				}
				else {
					cout << "00" << r[i];
				}
			}
			else {
				cout << "0" << r[i];
			}
		}
		else {
			cout << r[i];
		}
		cout << endl;
	}
	return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User olphe
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1751 Byte
Status AC
Exec Time 19 ms
Memory 256 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 19 ms 256 KB
chokudai_ga_cho.txt AC 15 ms 256 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 1 ms 256 KB
test_10.txt AC 1 ms 256 KB
test_11.txt AC 1 ms 256 KB
test_12.txt AC 1 ms 256 KB
test_13.txt AC 1 ms 256 KB
test_14.txt AC 1 ms 256 KB
test_15.txt AC 1 ms 256 KB
test_16.txt AC 1 ms 256 KB
test_17.txt AC 1 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 13 ms 256 KB
test_22.txt AC 14 ms 256 KB
test_23.txt AC 13 ms 256 KB
test_24.txt AC 14 ms 256 KB
test_25.txt AC 14 ms 256 KB
test_26.txt AC 13 ms 256 KB
test_27.txt AC 13 ms 256 KB
test_28.txt AC 13 ms 256 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 3 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 9 ms 256 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 14 ms 256 KB
test_37.txt AC 13 ms 256 KB
test_38.txt AC 13 ms 256 KB
test_39.txt AC 13 ms 256 KB
test_40.txt AC 13 ms 256 KB
test_41.txt AC 16 ms 256 KB
test_42.txt AC 16 ms 256 KB
test_43.txt AC 16 ms 256 KB