11724,2667 (#62)

Author: dia312

syheo/codingTest1/Baekjoon/11724-2.py

@@ -0,0 +1,45 @@
+#solved.ac
+#실버2
+#DFS&BFS
+#연결 요소의 갯수
+#11724
+
+#BFS 풀이
+import sys
+from collections import deque
+
+input = sys.stdin.readline
+
+def bfs(start):
+    if visited[start]:
+        return False
+    q = deque([start])
+
+    while q:
+        v = q.popleft()
+        visited[v]=True
+        
+        for edge in edges[v]:
+            if not visited[edge]:
+                visited[edge]=True
+                q.append(edge)
+    return True
+
+N,M = map(int,input().split())
+#인접리스트 
+edges = [[] for _ in range(N+1)]
+cnt = 0
+for i in range(M):
+    a,b = map(int,input().split())
+    edges[a].append(b)
+    edges[b].append(a)
+visited = [False for _ in range(N+1)]
+
+for i in range(1,N+1):
+    if bfs(i):
+        cnt+=1
+
+print(cnt)
+    
+
+

syheo/codingTest1/Baekjoon/11724.py

@@ -0,0 +1,38 @@
+#solved.ac
+#실버2
+#DFS&BFS
+#연결 요소의 갯수
+#11724
+
+#dfs 풀이
+import sys
+input = sys.stdin.readline
+sys.setrecursionlimit(10**7)
+
+def dfs(start):
+    if visited[start]:
+        return False
+    visited[start]=True
+
+    for v in edges[start]:
+        if not visited[v]:
+            dfs(v)
+    return True
+
+N,M = map(int,input().split())
+#인접리스트 
+edges = [[] for _ in range(N+1)]
+cnt = 0
+for i in range(M):
+    a,b = map(int,input().split())
+    edges[a].append(b)
+    edges[b].append(a)
+visited = [False for _ in range(N+1)]
+for i in range(1,N+1):
+    if dfs(i):
+        cnt+=1
+
+print(cnt)
+    
+
+

syheo/codingTest1/Baekjoon/2667.py

@@ -0,0 +1,49 @@
+#solved.ac
+#실버2
+#DFS&BFS
+#단지 번호 붙이기
+#2667
+
+import sys
+from collections import deque
+input = sys.stdin.readline
+
+moves = [(1,0),(0,1),(-1,0),(0,-1)]
+
+def bfs(row,col,N):
+    cnt = 0
+    #시작 좌표 큐에 넣어줌 
+    q = deque([(row,col)])
+    visited[row][col]=True
+    while q:
+        row,col = q.popleft()
+        cnt+=1
+        for move in moves:
+            r = row+move[0]
+            c = col+move[1]
+            if 0<=r<=N-1  and 0<=c<=N-1:
+                if maps[r][c]==1 and not visited[r][c]:
+                    q.append((r,c))
+                    visited[r][c]=True
+    return cnt 
+                
+
+N = int(input())
+visited=[[False]*N for i in range(N)]
+maps = []
+cntList = []
+#입력 
+for i in range(N):
+    maps.append(list(map(int,list(input().rstrip()))))
+
+#bfs 방문
+for i in range(N):
+    for j in range(N):
+        if not visited[i][j] and maps[i][j]:
+            cnt = bfs(i,j,N)
+            cntList.append(cnt)
+
+cntList.sort()
+print(len(cntList))
+for cnt in cntList:
+    print(cnt)