๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ
  • What would life be If we had no courage to attemp anything?
Problem Solving/BAEKJOON

[baekjoon]python #2477 ์ฐธ์™ธ๋ฐญ

by DevIseo 2022. 3. 11.
S = int(input())
arr = [list(map(int,input().split())) for _ in range(6)]

row_max = 0
row = 0
col_max = 0
col=0

for i in range(6):
    if arr[i][0] == 2 or arr[i][0] == 1:
        if arr[i][1] > row_max:
            row_max = arr[i][1]
            row = i

    elif arr[i][0] == 3 or arr[i][0] == 4:
        if arr[i][1] > col_max:
            col_max = arr[i][1]
            col = i
#๊ฐ€์žฅ ๊ธด row์˜ ์–‘ ์˜† col์„ ๋นผ์ฃผ์–ด ์ž‘์€ ์‚ฌ๊ฐํ˜•์˜ height(col)์„ ๊ตฌํ•จ
height = abs(arr[(row-1)%6][1] - arr[(row+1)%6][1])
#๊ฐ€์žฅ ๊ธด col์˜ ์–‘ ์˜† row์„ ๋นผ์ฃผ์–ด ์ž‘์€ ์‚ฌ๊ฐํ˜•์˜ width(row)์„ ๊ตฌํ•จ
width = abs(arr[(col-1)%6][1] - arr[(col+1)%6][1])

area = (row_max*col_max)-(height*width)
print(area*S)

์ฒ˜์Œ์—๋Š” ์‰ฌ์šด์ค„ ์•Œ๊ณ  ์‰ฝ๊ฒŒ ์ ‘๊ทผํ–ˆ๋Š”๋ฐ, ๋ฐ˜๋ก€๋ฅผ ๋‚˜์ค‘์— ๋ฐœ๊ฒฌํ•ด์„œ ๊ฝค๋‚˜ ์‹œ๊ฐ„์ด ์˜ค๋ž˜ ๊ฑธ๋ ธ๋‹ค....

๋Œ“๊ธ€