Submission #521033

---

Source Code Expand

import sys, re, math

def fs1(s):
    h = int(s[:2]); m = math.floor(int(s[2:])/5)*5
    return h*60+m

def fe1(s):
    h = int(s[:2]); m = math.ceil(int(s[2:])/5)*5
    return h*60+m

def f2(d):
    h = math.trunc(d/60); m = d%60
    hs = '0'+str(h) if h < 10 else str(h)
    ms = '0'+str(m) if m < 10 else str(m)
    return hs+ms

se_list_raw = list()
N = int(sys.stdin.readline())
for i in range(N):
    raw_s = sys.stdin.readline()
    res, ree = re.match('([0-9]+)-([0-9]+)', raw_s).groups()
    s = fs1(res); e = fe1(ree)
    se_list_raw.append((s, e))

se_list = sorted(se_list_raw, key=lambda x: x[0])

state = 0
minmin = se_list[0][0]
maxmax = se_list[0][1]
i = 0

result_list = list()

for s, e in se_list:
    if i == len(se_list) - 1:
        result_list.append((minmin, maxmax))
        continue
    if i == 0:
        minmin = s; maxmax = e
    ns, ne = se_list[i+1]

    if maxmax < ns:
        result_list.append((minmin, maxmax))
        minmin = ns; maxmax = ne
    else:
        if maxmax < ne:
            maxmax = ne
    i += 1

for s, e in result_list:
    ss, es = tuple(map(f2, [s, e]))
    print("{0}-{1}".format(ss, es))

Submission Info

Judge Result