Submission #407296


Source Code Expand

#include <algorithm>
#include <iostream>
#include <string>

using namespace::std;

int dec(int num,int se){//nnnn
	int h = num/100;
	int m = num%100;
	int ans = 0;
	ans += h*12;
	ans += m/5;
	//if(se == 0){//降り始め
	//}
	if(se == 1){//降り終わり
		if(m%5 != 0){
			++ans;
		}
	}
	return ans;
}

void enc(int num){//nnnn形式に戻す

	int h = (num/12);
	int m = (num%12)*5;

	if( h == 0){
		cout << "00";
	}else if( h<10){
		cout << "0" << h;
	}else{
		cout << h;
	}
	
	if( m == 0){
		cout << "00";
	}else if( m < 10){
		cout << "0" << m;
	}else{
		cout << m;
	}
}

int main(void){
	cin.tie(0);
    ios::sync_with_stdio(false);
	
	int N;
	cin >> N;
	string se[30000];
	//vector<string> seList;

	const int timeN = 24*6*2+1;
	for(int i=0; i<N;++i){
		cin >> se[i];
	}
	
	int time[timeN];//5min刻み

	for(int i=0;i<timeN;++i){
		time[i] = 0;
	}
	int temp = 0;
	
	for(int i=0;i<N;++i){
		temp = (se[i][0]-'0')*1000+(se[i][1]-'0')*100
			+(se[i][2]-'0')*10+(se[i][3]-'0');
		++time[dec(temp,0)];
		temp = (se[i][5]-'0')*1000+(se[i][6]-'0')*100
			+(se[i][7]-'0')*10+(se[i][8]-'0');
		--time[dec(temp,1)];
	}
	
	for(int i=1;i<timeN;++i){
		time[i] = time[i] + time[i-1];
	}

	int count = 0;
	bool inside = false;
	
	for(int i=0; i<timeN;++i){
		if( (inside == false) && (time[i] > 0) ){
			inside = true;
			enc(i);
			cout << "-";
		}
		else if( (inside == true) && (time[i] == 0) ){
			inside = false;
			enc(i);
			cout << "\n";
		}
	}

	return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User akarin55
Language C++ (G++ 4.6.4)
Score 100
Code Size 1557 Byte
Status AC
Exec Time 44 ms
Memory 2908 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 30 ms 1432 KB
00_sample_02.txt AC 28 ms 1452 KB
00_sample_03.txt AC 28 ms 1432 KB
cho_cho_chokudai.txt AC 38 ms 2836 KB
chokudai_ga_cho.txt AC 44 ms 2836 KB
test_01.txt AC 28 ms 1428 KB
test_02.txt AC 31 ms 1432 KB
test_03.txt AC 33 ms 1504 KB
test_04.txt AC 31 ms 1436 KB
test_05.txt AC 30 ms 1432 KB
test_06.txt AC 29 ms 1432 KB
test_07.txt AC 31 ms 1428 KB
test_08.txt AC 30 ms 1428 KB
test_09.txt AC 31 ms 1432 KB
test_10.txt AC 30 ms 1428 KB
test_11.txt AC 30 ms 1436 KB
test_12.txt AC 41 ms 1488 KB
test_13.txt AC 30 ms 1436 KB
test_14.txt AC 29 ms 1436 KB
test_15.txt AC 30 ms 1432 KB
test_16.txt AC 30 ms 1428 KB
test_17.txt AC 30 ms 1440 KB
test_18.txt AC 28 ms 1432 KB
test_19.txt AC 29 ms 1428 KB
test_20.txt AC 29 ms 1436 KB
test_21.txt AC 40 ms 2836 KB
test_22.txt AC 40 ms 2836 KB
test_23.txt AC 40 ms 2840 KB
test_24.txt AC 41 ms 2840 KB
test_25.txt AC 40 ms 2756 KB
test_26.txt AC 40 ms 2840 KB
test_27.txt AC 41 ms 2812 KB
test_28.txt AC 40 ms 2908 KB
test_29.txt AC 31 ms 1436 KB
test_30.txt AC 29 ms 1496 KB
test_31.txt AC 31 ms 1556 KB
test_32.txt AC 30 ms 1424 KB
test_33.txt AC 36 ms 2324 KB
test_34.txt AC 30 ms 1508 KB
test_35.txt AC 30 ms 1432 KB
test_36.txt AC 41 ms 2836 KB
test_37.txt AC 40 ms 2836 KB
test_38.txt AC 39 ms 2904 KB
test_39.txt AC 39 ms 2836 KB
test_40.txt AC 40 ms 2840 KB
test_41.txt AC 40 ms 2756 KB
test_42.txt AC 41 ms 2816 KB
test_43.txt AC 40 ms 2840 KB