[Python] 백준(BOJ) 2477번: 참외밭

문제

2477번: 참외밭

풀이

import sys
N = int(sys.stdin.readline())  # 마지막에 곱해줄애

li = [[0, 0]]
cur_x, cur_y = 0, 0
for _ in range(6):
    cmd, lenght = map(int, sys.stdin.readline().split(" "))

    if cmd == 1:
        cur_x += lenght
    elif cmd == 2:
        cur_x -= lenght
    elif cmd == 3:
        cur_y -= lenght
    else:
        cur_y += lenght

    li.append([cur_x, cur_y])

min_x = 0
max_x = 0
min_y = 0
max_y = 0
for each in li:
    min_x = min(each[0], min_x)
    min_y = min(each[1], min_y)
    max_x = max(each[0], max_x)
    max_y = max(each[1], max_y)

if min_x < 0:
    for each in li:
        each[0] += abs(min_x)
    max_x += abs(min_x)

if min_y < 0:
    for each in li:
        each[1] += abs(min_y)
    max_y += abs(min_y)

mid_x = [0, 0]
mid_y = [0, 0]
for each in li:
    if each[0] != 0 and each[0] != max_x and (each[1] == 0 or each[1] == max_y):
        mid_x = each
    if each[1] != 0 and each[1] != max_y and (each[0] == max_x or each[0] == 0):
        mid_y = each

big_area = max_x * max_y
mid_point = [mid_x[0], mid_y[1]]
if mid_x[1] == 0 and mid_y[0] == 0: # 1
    small_area = mid_x[0] * mid_y[1]
elif mid_x[1] == 0: # 2
    small_area = (max_x - mid_point[0]) * mid_point[1]
elif mid_y[0] == 0: # 4
    small_area = (max_y - mid_point[1]) * mid_point[0]
else:
    small_area = (max_y - mid_point[1]) * (max_x - mid_point[0])

print((big_area - small_area) * N)