Submission #3934396


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

template < typename T >
void vprint(T &v){
	REP(i, v.size()){
		cout << v[i] << " ";
	}
	cout << endl;
}

void time2str(ll time){
	ll t1 = time/600;
	time %= 600;
	ll t2 = time/60;
	time %= 60;
	ll t3 = time/10;
	time %= 10;
	ll t4 = time;

	cout << t1 << t2 << t3 << t4;
	return;
}

int main(){
	ll N;
	cin >> N;
	ll imos[1442];
	REP(i, 1442) imos[i] = 0;
	REP(i, N){
		string S;
		cin >> S;
		ll start = 600*(S[0]-'0') + 60*(S[1]-'0') + 10*(S[2]-'0') + (S[3]-'0');
		start -= start%5;
		ll end = 600*(S[5]-'0') + 60*(S[6]-'0') + 10*(S[7]-'0') + (S[8]-'0');
		if(end%5!=0) end = end - (end%5) + 5;
		imos[start]++;
		imos[end+1]--;
	}
	REP(i, 1441) imos[i+1] += imos[i];
	ll index = 0;
	REP(i, 1442){
		if(i==0){
			if(imos[i]>0) cout <<"0000-";
		}else{
			if(imos[i]==0 && imos[i-1]>0){
				time2str(i-1);
				cout << endl;
			}if(imos[i]>0 && imos[i-1]==0){
				time2str(i);
				cout << "-";
			}
		}
	}
    return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User theory_and_me
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1410 Byte
Status AC
Exec Time 23 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 23 ms 256 KB
chokudai_ga_cho.txt AC 23 ms 256 KB
test_01.txt AC 2 ms 256 KB
test_02.txt AC 2 ms 256 KB
test_03.txt AC 2 ms 256 KB
test_04.txt AC 2 ms 256 KB
test_05.txt AC 2 ms 256 KB
test_06.txt AC 2 ms 256 KB
test_07.txt AC 2 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 2 ms 256 KB
test_13.txt AC 2 ms 256 KB
test_14.txt AC 2 ms 256 KB
test_15.txt AC 2 ms 256 KB
test_16.txt AC 2 ms 256 KB
test_17.txt AC 2 ms 256 KB
test_18.txt AC 2 ms 256 KB
test_19.txt AC 2 ms 256 KB
test_20.txt AC 2 ms 256 KB
test_21.txt AC 23 ms 256 KB
test_22.txt AC 23 ms 256 KB
test_23.txt AC 23 ms 256 KB
test_24.txt AC 23 ms 256 KB
test_25.txt AC 23 ms 256 KB
test_26.txt AC 23 ms 256 KB
test_27.txt AC 23 ms 256 KB
test_28.txt AC 23 ms 256 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 2 ms 256 KB
test_31.txt AC 5 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 15 ms 256 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 2 ms 256 KB
test_36.txt AC 23 ms 256 KB
test_37.txt AC 23 ms 256 KB
test_38.txt AC 23 ms 256 KB
test_39.txt AC 23 ms 256 KB
test_40.txt AC 23 ms 256 KB
test_41.txt AC 23 ms 256 KB
test_42.txt AC 23 ms 256 KB
test_43.txt AC 23 ms 256 KB