찬민 dfs/bfs 백준 숙제 (#57)

* 찬민 dfs/bfs 백준 숙제

* 무지의 먹방라이브

Author: bsyzch

cmkim/BaekJoon/백준_11724.py

@@ -0,0 +1,28 @@
+n, m = map(int, input().split())
+arr = [[0] * (n + 1) for _ in range(n + 1)]
+visited = [0] * (n + 1)
+result = 0
+
+def dfs(num):
+    visited[num] = 1
+    
+    for i in range(1, n+1):
+        if visited[i] == 0 and arr[num][i] == 1:
+            visited[i] = 1
+            dfs(i)
+    return True
+
+
+
+for i in range(m):          #연결리스트
+    a, b = map(int, input().split())
+    arr[a][b] = 1
+    arr[b][a] = 1
+
+
+for i in range(1, n + 1):
+    if visited[i] == 0:
+        dfs(i)
+        result += 1
+print(result)
+

cmkim/BaekJoon/백준_2667.py

@@ -0,0 +1,39 @@
+from collections import deque
+
+n = int(input())
+arr = [[0] * n for _ in range(n)]
+visited = [[0] * n for _ in range(n)]
+dx, dy = [-1, 1, 0 , 0], [0, 0, -1, 1] # 상하좌우 순
+answer = []
+
+def bfs():
+    count = 1
+    while q:
+        x, y = q.popleft()  # x는 row, y는 col
+        visited[x][y] = 1
+        for i in range(4):
+            nx = x + dx[i]
+            ny = y + dy[i]
+            if 0 <= nx < n and 0 <= ny < n and visited[nx][ny] == 0 and arr[nx][ny] == 1:
+                visited[nx][ny] = 1
+                q.append((nx, ny))
+                count += 1
+    return count
+
+
+for i in range(n):
+    arr[i] = list(map(int, input().rstrip()))
+
+q = deque()
+for i in range(n):
+    for j in range(n):
+        if arr[i][j] and visited[i][j] == 0:
+            q.append((i, j))
+            result = bfs()
+            if result:
+                answer.append(result)
+
+print(len(answer))
+answer.sort()
+for i in range(len(answer)):
+    print(answer[i])

cmkim/무지의 먹방 라이브_316p.py

@@ -0,0 +1,79 @@
+# https://programmers.co.kr/learn/courses/30/lessons/42891
+import copy
+
+
+def solution(food_times, k):
+    answer = 0
+    arr = []
+    arr2 = []
+    arr = copy.deepcopy(food_times)
+    cost = [0] * len(arr)
+    accumulate_cost = [0] * len(arr)
+
+    arr.sort()
+
+    cur = 0
+    count = 0
+    sum = 0
+
+    for i in range(len(arr)):
+        if cur != arr[i]:
+            cost[i] = (len(arr) - count) * (arr[i] - sum)
+            cur = arr[i]
+            sum = cur
+            for j in range(i, len(arr)):
+                if arr[i] == arr[j]:
+                    count += 1
+
+    # print(cost)
+
+    accumulate_cost[0] = cost[0]
+    for i in range(1, len(arr)):
+        accumulate_cost[i] = accumulate_cost[i - 1] + cost[i]
+        maxac = accumulate_cost[i]
+    # print(accumulate_cost)
+
+    n = 0
+    for i in range(len(arr)):
+        n = accumulate_cost[i]
+        if n > k:
+            # print('i = ', i)
+            n = arr[i - 1]
+            m = k - accumulate_cost[i - 1]
+            break
+    # print('k = ',k)
+    # print('maxac = ', maxac)
+
+    if k >= maxac:
+        # print('Overflow')
+        return -1
+
+    #    m = k - accumulate_cost[n]
+
+    # print('n = ' , n)
+    # print('m = ' , m)
+
+    # print(food_times)
+
+    cnt = 0
+    for i in range(len(arr)):
+        if food_times[i] > n:
+            arr2.append(food_times[i])
+
+    length = len(arr2)
+
+    for i in range(len(arr)):
+        if food_times[i] > n:
+            m %= length
+            # print('cnt = ', cnt)
+            # print('foodtimes = ', food_times[i])
+            if length >= m:
+                if cnt == m:
+                    # print('i = ', i)
+                    answer = i + 1
+                    break
+                cnt += 1
+
+    # print(answer)
+
+    return answer

cmkim/문자열뒤집기_313p.py

@@ -9,4 +9,4 @@
         temp = arr[0][i]
         count += 1
 
-print(count//2)
+print((count+1)//2)