Submission #3132919

---

Source Code Expand

def toDown(n):
    q, mod = divmod(n,100)
    mod = mod - (mod % 5)
    return q * 100 + mod
def toUp(n):
    q, mod = divmod(n,100)
    if mod > 55:
        return (q + 1) * 100
    else:
        if mod % 5 != 0:
            mod = mod - (mod % 5) + 5
        return q * 100 + mod
def LTC(x):
    i = 0
    while(i < len(x) - 1):
        if x[i][1] >= x[i + 1][0]:
            x[i][1] = max(x[i][1],x[i + 1][1])
            x.pop(i + 1)
        else:
            i += 1
    return None


n = int(input())
lll = [None] * n
for i in range(n):
    a, b = map(int,input().split("-"))
    a = toDown(a)
    b = toUp(b)
    lll[i] = [a, b]

lll = sorted(lll,key = lambda x: x[0])
LTC(lll)
for i in range(len(lll)):
    print('{:0=4}-{:0=4}'.format(lll[i][0],lll[i][1]))

Submission Info

Judge Result