# jungol 1671 '색종이(중)'
n = int(input())
MAP = [[False for _ in range(101)] for _ in range(101)]
for _ in range(n):
st_j, st_i = map(int, input().split())
for i in range(st_i, st_i + 10):
for j in range(st_j, st_j + 10):
MAP[i][j] = True
total = 0
for j in range(1, 101):
for i in range(1, 101):
if MAP[i][j] != MAP[i - 1][j]:
total += 1
for i in range(1, 101):
for j in range(1, 101):
if MAP[i][j] != MAP[i][j - 1]:
total += 1
print(total)
'알고리즘 문제 풀이 > 정올' 카테고리의 다른 글
[정올 1438 python] 색종이(초) (0) | 2021.08.26 |
---|