ํฐ์คํ ๋ฆฌ ๋ทฐ
์ฌ๋ฐฉ๋ฉด์ ๊ฐ์ ์๊น ์๋์ง ๊ฒ์ฌ DFS
๊ทธ๋ฅ DFS
‘R’์ ‘G’๋ก ๋ฐ๊พธ๊ณ DFS ํ๋ฒ ๋
import sys
from collections import deque
sys.setrecursionlimit(1000000)
input = sys.stdin.readline
def DFS(x, y):
dx = [-1, 1, 0, 0]
dy = [0, 0, -1, 1]
visited[y][x] = 1
for i in range(4):
nowx, nowy = x+dx[i], y+dy[i]
if 0<=nowx<N and 0<=nowy<N and graph[y][x] == graph[nowy][nowx] and visited[nowy][nowx] == 0:
DFS(nowx, nowy)
N = int(input().rstrip())
graph = [list(input().rstrip()) for _ in range(N)]
visited = [[0] * (N) for _ in range(N)]
cnt1 = 0
for i in range(N):
for j in range(N):
if visited[i][j] == 0:
cnt1 += 1
DFS(j, i)
for i in range(N):
for j in range(N):
if graph[i][j] == 'R':
graph[i][j] = 'G'
cnt2 = 0
visited = [[0] * (N) for _ in range(N)]
for i in range(N):
for j in range(N):
if visited[i][j] == 0:
cnt2+=1
DFS(j, i)
print(cnt1, cnt2)
๋ฐ์ํ
'Programming > ๋ฐฑ์ค' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
230228 [2775: ๋ถ๋ ํ์ฅ์ด ๋ ๊ฑฐ์ผ] (0) | 2023.09.02 |
---|---|
230228 [1327: ์ํธ๊ฒ์] (0) | 2023.09.02 |
230219 [2606: DFS] (0) | 2023.09.02 |
230219 [1260: DFS&BFS] (0) | 2023.09.02 |
230207 [1929 : ๋ ๋น ๋ฅด๊ฒ ์์ ๊ตฌํ๊ธฐ] (0) | 2023.09.02 |
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- Today
- Yesterday
๋งํฌ
TAG
- MYSQL
- SQL
- gan
- SKTECHSUMMIT
- ํ์ด์ฌ
- ๊ธฐ์ ์ปจํผ๋ฐ์ค
- lgaimers
- ํ์ด์ฌ์ฝํ
- ๋ ผ๋ฌธ๋ฆฌ๋ทฐ
- ์ฝ๋ฉ๊ณต๋ถ
- AIRUSH
- CLOVAX
- HyperCLOVA
- ๊ตฌ๊ธ์ฝ๋ฉ
- ๋๋ฆผ๋ถ์ค
- ๋ ผ๋ฌธ์ฝ๊ธฐ
- dreambooth
- StableDiffusion
- ์คํ ์ด๋ธ๋ํจ์
- ์ฝํ
- ํ ํฌ์๋ฐ
- Aimers
- DALLE
- ์ฝ๋ฉ์๋ฌ
- WGAN
- ํ๋ก๊ทธ๋๋จธ์ค
- C์ธ์ด
- ์ฝํ ์ค๋น
- AIRUSH2023
- AI์ปจํผ๋ฐ์ค
์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | |
7 | 8 | 9 | 10 | 11 | 12 | 13 |
14 | 15 | 16 | 17 | 18 | 19 | 20 |
21 | 22 | 23 | 24 | 25 | 26 | 27 |
28 | 29 | 30 | 31 |
๊ธ ๋ณด๊ดํจ