CCF CSP 201709-1/2 打酱油/公共钥匙盒 python

201709-1 打酱油

满分实现：

N = int(input())
n_5 = N//50
n_3 = (N - n_5*50)//30
n_1 = (N-n_5*50-n_3*30)//10
num = n_5*7+n_3*4+n_1
print(num)

201709-2 公共钥匙盒

满分实现：

N,K = map(int,input().split())

time = {}

key_init = [i+1 for i in range(N)]

for i in range(K):
    w,s,c = map(int,input().split())
    e = s+c
    if s not in time:
        time[s] = [[],[]]
    if e not in time:
        time[e] = [[],[]]
    # 0: borrow 1: return
    time[s][0].append(w)
    time[e][1].append(w)
        
for k,v in sorted(time.items()):
    
    if v[1]==[]:
        for i in v[0]:
            index = key_init.index(i)
            key_init[index] = -1
    else:
        for i in sorted(v[1]):
            index = key_init.index(-1)
            key_init[index] = i
        for i in v[0]:
            index = key_init.index(i)
            key_init[index] = -1

for i in key_init:
    print(i,end=" ")

一把辛酸泪，做了蛮久的一道题！