Submission #5443504

---

Source Code Expand

from sys import stdin


def readLines():
    return [line.rstrip() for line in iter(stdin.readline, '')]


def putLine(line):
    print(line, flush=True)


def putLines(lines):
    for line in lines:
        putLine(line)


def isConflict(x, b, a):
    # x     |------|
    # b        |-
    # a       -|
    # or
    # b-a   |------|
    # x[0]     |-
    # x[1]    -|
    # を以って時間帯の重複と判断
    if (x[0] <= b and b <= x[1]):
        return True
    if (x[0] <= a and a <= x[1]):
        return True
    if (b <= x[0] and x[0] <= a):
        return True
    if (b <= x[1] and x[1] <= a):
        return True
    return False


def main(lines):
    """
    implemente concret logic
    """
    result = []
    tmp = []

    carryup = (lambda h, m: (h, m) if m < 60 else (h+1, m % 60))
    mod5down = (lambda h, m: carryup(h, m-(m % 5)))
    mod5up = (lambda h, m: carryup(h, m if m % 5 == 0 else m + (5 - (m % 5))))
    tostr = (lambda h, m: "%02d%02d" % (h, m))

    # "xxxx-yyyy"に5分刻みを適用し "XXXX-YYYY"に変換
    for l in lines[1:]:
        # 前後を時、分でそれぞれ分割
        [(b1, b2), (a1, a2)] = [(x[:2], x[2:]) for x in l.split("-")]
        # 直前への丸め
        (b1, b2) = mod5down(int(b1), int(b2))
        # 直後への丸め
        (a1, a2) = mod5up(int(a1), int(a2))

        tmp.append(tostr(b1, b2) + "-" + tostr(a1, a2))

    # 昇順ソート
    tmp.sort()

    # 時刻をマージ
    t = tmp[0].split("-")
    result.append([t[0], t[1]])
    for x in tmp[1:]:
        t = x.split("-")
        for r in result:
            # 重複がある場合
            if isConflict(r, t[0], t[1]):
                # 開始は早い方
                # 終了は遅い方
                r[0] = min(r[0], t[0])
                r[1] = max(r[1], t[1])
                break
            # 重複なしは単純追加
            result.append([t[0], t[1]])

    return ["%s-%s" % (x[0], x[1]) for x in result]


putLines(main(readLines()))

Submission Info

Judge Result