D2
Problem
SW Expert Academy ์์น ํ๊ธฐ
SW Expert Academy
SW ํ๋ก๊ทธ๋๋ฐ ์ญ๋ ๊ฐํ์ ๋์์ด ๋๋ ๋ค์ํ ํ์ต ์ปจํ ์ธ ๋ฅผ ํ์ธํ์ธ์!
swexpertacademy.com
Solution
1. ๋นจ๊ฐ์๊ณผ ํ๋์์ ๋ฒ์๋ฅผ ๋ฐ๋ก ์์น ํ ํ, ๋ง์ฝ ํ ๊ณณ์ ์์น ํด์ง๋ค๋ฉด ๋ณด๋ผ์์ด ๋๋ฏ๋ก ์นด์ดํ ํ๋ค.
Code
for test_case in range(1, int(input()) + 1):
N = int(input())
arr = [list(map(int, input().split())) for _ in range(N)]
page_red = [[0 for _ in range(10)] for _ in range(10)]
page_blue = [[0 for _ in range(10)] for _ in range(10)]
purple = 0
for i in range(N):
for k in range(arr[i][2] - arr[i][0] + 1):
for l in range(arr[i][3] - arr[i][1] + 1):
if arr[i][-1] == 1:
# ๋นจ๊ฐ ์ ์น ํ๊ธฐ
page_red[arr[i][0] + k][arr[i][1] + l] = 1
else:
# ํ๋์ ์น ํ๊ธฐ
page_blue[arr[i][0] + k][arr[i][1] + l] = 1
for i in range(10):
for j in range(10):
# ๋นจ๊ฐ์ + ํ๋์ >=2 ์ด๋ฉด ํผํ
if page_red[i][j] + page_blue[i][j] >= 2:
purple += 1
print(f'#{test_case} {purple}')
<๋ถ์กฑํ ๋ถ๋ถ์ ๋๊ธ๋ก ๋จ๊ฒจ์ฃผ์๋ฉด ์ ์๊ฒ ๋์์ด ๋ฉ๋๋ค!>
<๊ทธ๋ฆผ ์ถ์ฒ: SWEA ์์น ํ๊ธฐ>
๋ฐ์ํ
'๐ STUDY > ์๋ฃ๊ตฌ์กฐ & ์๊ณ ๋ฆฌ์ฆ' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
| 1209. [S/W ๋ฌธ์ ํด๊ฒฐ ๊ธฐ๋ณธ] 2์ผ์ฐจ - Sum (0) | 2023.03.05 |
|---|---|
| 2001. ํ๋ฆฌ ํด์น (0) | 2023.03.05 |
| 4837. [ํ์ด์ฌ S/W ๋ฌธ์ ํด๊ฒฐ ๊ธฐ๋ณธ] 2์ผ์ฐจ - ๋ถ๋ถ ์งํฉ์ ํฉ (0) | 2023.03.05 |
| 16268. ํ์ ํก2 (2) | 2023.03.05 |
| 9490. ํ์ ํก (2) | 2023.03.05 |
