시나위

def solution(progresses, speeds): answer = [] while (progresses!=[]): ed=[] # complete len_p=len(progresses) for i in range(len_p): progresses[i]+=speeds[i] for i in range(len_p): if progresses[i]>=100: ed.append(progresses[i]) else: break if ed!=[]: answer.append(len(ed)) for i in ed: del progresses[0] del speeds[0] return answer

def solution(bridge_length, weight, truck_weights): answer = 0 ing=[] # 다리를 건너는 트럭 cnt=[] # 트럭당 지난 거리 ed=[] # 다리를 지난 트력 while 1: if (truck_weights == []) and (ing == []): break answer+=1 # count total time for i in range(len(cnt)): # decrease the times of trucks above the bridge cnt[i]-=1 if (cnt!=[])and(cnt[0]==0): ed.append(ing[0]) del cnt[0] del ing[0] if (sum(ing) max_weight: bridge.append(0..