제출 #659585

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
659585		beaconmc	Fancy Fence (CEOI20_fancyfence)	Pypy 3	12 / 100	50 ms	19328 KiB

fancyfence

n = int(input())
h = list(map(int, input().split()))
w = list(map(int, input().split()))


sussies = [list(i) for i in zip(h,w)]
stack = []

def rect(a,b):
    return a*(a+1)*b*(b+1)//4

def comb():
    if len(stack)>1 and stack[-1][0] == stack[-2][0]:
        a = stack.pop()[1]
        stack[-1][1] += a

ans = 0
for i in sussies:
    if not stack:
        stack.append(i)
    else:
        while stack[-1][0] > i[0]:
            
            if len(stack)==1:
                ans += rect(stack[-1][0],stack[-1][1])-rect(i[0],stack[-1][1])
                stack[-1][0] = i[0]
            else:
                sus = max(stack[-2][0], i[0])
                ans += rect(stack[-1][0],stack[-1][1])-rect(sus,stack[-1][1])
                stack[-1][0] = sus
                comb()
        stack.append(i)
        comb()

while len(stack) != 1:
    sus = stack[-2][0]
    ans += rect(stack[-1][0],stack[-1][1])-rect(sus,stack[-1][1])
    stack[-1][0] = sus
    comb()

ans += rect(stack[0][0], stack[0][1])

print(ans)
                

• Subtask 1: 0 / 0
• Subtask 2: 12 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 18
• Subtask 7: 0 / 27