Submission #1997810

---

Source Code Expand

from math import ceil
from math import floor
from functools import partial
def is_intersection(I1, I2):
    [a1, b1] = I1
    [a2, b2] = I2
    return (a2 <= b1 and a1 <= b2) or (a1 <= b2 and a2 <= b1)

def union(I1, I2):
    [a1, b1] = I1
    [a2, b2] = I2
    return (min(a1, a2), max(b1, b2))

to_HHMM = lambda MM:(MM // 60)*100 + (MM % 60)

N = int(input())
rain_interval = []

for n in range(0, N):
    to_MM = lambda HHMM:(HHMM // 100)*60 + (HHMM % 100)
    [S, E] = map(lambda x:to_MM(int(x)), input().split("-"))
    S = floor(S/5)*5
    E = ceil(E/5)*5
    tmp = interval = (S, E)
    for i in filter(partial(is_intersection, interval), rain_interval.copy()):
        tmp = union(tmp, i)
        rain_interval.remove(i)
    else: 
        rain_interval.append(tmp)

for [S, E] in sorted(rain_interval):
    print("{:04d}".format(to_HHMM(S)) + '-' + "{:04d}".format(to_HHMM(E)))

Submission Info

Judge Result