Submission #1910024

---

Source Code Expand

def p(l):
    s, e = l
    s_m = str(int(s[2:]) - int(s[2:]) % 5)
    s = s[:2] + '0' * (2 - len(s_m)) + s_m
    e_m = str(int(e[2:]) + (5 - int(e[2:]) % 5) % 5)
    if e_m == '60':
        e = str(int(e[:2]) + 1) + '00'
    else:
        e = e[:2] + '0' * (2 - len(e_m)) + e_m
    return map(int, [s, e])
o = sorted([p(raw_input().split('-')) for _ in xrange(input())], key = lambda x: x[0])
n = []
st, et = o[0][0], o[0][1]
for i in o[1:]:
    if i[0] > et:
        n.append((st, et))
        st, et = i[0], i[1]
    else:
        et = max(et, i[1])
n.append((st, et))
print '\n'.join(['0' * (4 - len(str(s))) + str(s) + '-' + '0' * (4 - len(str(e))) + str(e) for s, e in n])

Submission Info

Judge Result