문제링크

문제풀이

def solution(cap, n, deliveries, pickups):
    answer=0
    deli=deliveries[::-1]
    pick=pickups[::-1]
    must_deli=0
    must_pick=0
    for i in range(n):
        must_deli+=deli[i]
        must_pick+=pick[i]
        while must_deli>0 or must_pick>0:
            must_deli-=cap
            must_pick-=cap
            answer+=(n-i)*2
    return answer
profile
코딩 잘하고 싶음..

0개의 댓글

관련 채용 정보