Submission #6928937


Source Code Expand

# -*- coding: utf-8 -*-

import sys
from itertools import accumulate

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

N = INT()
SE = []
for i in range(N):
    s, e = map(int, input().split('-'))
    SE.append((s, e))

for i in range(N):
    s, e = SE[i]
    # 5区切りで下に丸める
    if s%5 != 0:
        s -= s%5
    # 5区切りで上に丸める
    if e%5 != 0:
        e += 5 - e%5
        # 時間の繰り上がりを調整
        if str(e)[-2:] == '60':
            e += 40
    SE[i] = (s, e)

# imosで区間をまとめる
imos = [0] * 2402
for s, e in SE:
    imos[s] += 1
    imos[e+1] -= 1
imos = list(accumulate(imos))

is_raining = False
ans = []
# 5毎に確認していく
for i in range(0, 2402, 5):
    if is_raining:
        if imos[i+1] == 0:
            is_raining = False
            e = i
            ans.append((s, e))
    else:
        if imos[i] > 0:
            is_raining = True
            s = i

for s, e in ans:
    print('{0}-{1}'.format(format(s, '04'), format(e, '04')))

Submission Info

Submission Time
Task D - 感雨時刻の整理
User Coki628
Language Python (3.4.3)
Score 100
Code Size 1542 Byte
Status AC
Exec Time 107 ms
Memory 7300 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 18 ms 3188 KB
00_sample_02.txt AC 18 ms 3188 KB
00_sample_03.txt AC 18 ms 3188 KB
cho_cho_chokudai.txt AC 104 ms 6276 KB
chokudai_ga_cho.txt AC 101 ms 7084 KB
test_01.txt AC 18 ms 3188 KB
test_02.txt AC 18 ms 3188 KB
test_03.txt AC 18 ms 3188 KB
test_04.txt AC 18 ms 3188 KB
test_05.txt AC 18 ms 3188 KB
test_06.txt AC 18 ms 3188 KB
test_07.txt AC 18 ms 3188 KB
test_08.txt AC 18 ms 3188 KB
test_09.txt AC 19 ms 3188 KB
test_10.txt AC 19 ms 3188 KB
test_11.txt AC 19 ms 3188 KB
test_12.txt AC 19 ms 3188 KB
test_13.txt AC 18 ms 3188 KB
test_14.txt AC 19 ms 3188 KB
test_15.txt AC 19 ms 3188 KB
test_16.txt AC 18 ms 3188 KB
test_17.txt AC 19 ms 3188 KB
test_18.txt AC 18 ms 3188 KB
test_19.txt AC 19 ms 3188 KB
test_20.txt AC 19 ms 3188 KB
test_21.txt AC 101 ms 7172 KB
test_22.txt AC 101 ms 7300 KB
test_23.txt AC 99 ms 7164 KB
test_24.txt AC 102 ms 7292 KB
test_25.txt AC 101 ms 7188 KB
test_26.txt AC 101 ms 7016 KB
test_27.txt AC 97 ms 7236 KB
test_28.txt AC 107 ms 7064 KB
test_29.txt AC 18 ms 3188 KB
test_30.txt AC 18 ms 3188 KB
test_31.txt AC 31 ms 3692 KB
test_32.txt AC 18 ms 3188 KB
test_33.txt AC 73 ms 5580 KB
test_34.txt AC 18 ms 3188 KB
test_35.txt AC 18 ms 3188 KB
test_36.txt AC 98 ms 7156 KB
test_37.txt AC 103 ms 7036 KB
test_38.txt AC 98 ms 6932 KB
test_39.txt AC 98 ms 7236 KB
test_40.txt AC 99 ms 6928 KB
test_41.txt AC 86 ms 7088 KB
test_42.txt AC 85 ms 7060 KB
test_43.txt AC 85 ms 7092 KB