Merge branch 'main' into kcm_09_06

Author: bsyzch

cmkim/2021 네이버웹툰 개발 챌린지/1번문제.py

@@ -0,0 +1,25 @@
+def solution(lottery):
+    answer = -1
+
+    arr = [0] * 1001
+    visited = [0] * 1001
+    sum = 0
+    count = 0
+    for i in range(len(lottery)):
+        if lottery[i][1] == 0 and visited[lottery[i][0]] == 0:
+            arr[lottery[i][0]] += 1
+        else:
+            visited[lottery[i][0]] = 1
+
+    for i in range(1000):
+        if visited[i]:
+            sum += arr[i]
+            count += 1
+    #print(sum, count)
+
+    if sum:
+        answer = (sum+count) // count
+    else:
+        answer = 0
+
+    return answer

cmkim/2021 네이버웹툰 개발 챌린지/2번문제.py

@@ -0,0 +1,31 @@
+from _collections import deque
+
+
+
+dx = [-1, 1, 0, 0] #상하좌우
+dy = [0, 0, -1, 1]
+
+def solution(grid):
+    answer = 0
+    row = len(grid)
+    col = len(grid[0])
+    map = [[1e9] * col for _ in range(row)]
+    map[0][0] = grid[0][0]
+    q = deque()
+    q.append((0, 0))
+
+    while q:
+        x, y = q.popleft()
+        for i in range(4):
+            nx = x + dx[i]
+            ny = y + dy[i]
+            if 0 <= nx < row and 0 <= ny < col:
+                if map[x][y] + grid[nx][ny] < map[nx][ny]:
+                    map[nx][ny] = map[x][y] + grid[nx][ny]
+                    q.append((nx, ny))
+
+
+    answer = map[row-1][col-1]
+
+
+    return answer

cmkim/BaekJoon/백준_17179.py

@@ -0,0 +1,45 @@
+n, m, l = map(int, input().split())
+
+cut = []
+arr = []
+for i in range(m):  # 자르는 위치
+    cut.append(int(input()))
+#print(cut)
+
+for i in range(n):  # 자르는 횟수
+    arr.append(int(input()))
+
+def calculate(mid, count): # 가장 작은 조각의 길이 > mid 일때 횟수를 세서 count 값이 만들어지면 성공
+    prev = 0
+    for i in range(m):
+        if cut[i] - prev >= mid:
+            count -= 1
+            prev = cut[i]
+            if count == 0:
+                break
+
+
+    if count == 0 and l - prev >= mid:
+        return True
+    else:
+        return False
+
+for i in range(n):
+    piece = arr[i]
+    left = 0
+    right = l
+
+    while left + 1 < right:
+        mid = (left + right) // 2
+        if calculate(mid, piece):
+            left = mid
+        else:
+            right = mid
+
+    print(left)
+
+
+
+
+
+

cmkim/BaekJoon/백준_1939.py

@@ -0,0 +1,50 @@
+# 처음엔 플로이드워셜 알고리즘을 사용하는 줄 알았는데
+# 플로이드 워셜은 최솟값 구할때만 해당하는듯
+# 이 문제는 이때동안 풀었던 유형이랑 좀 다른게
+# 노드를 탐색해 나가며 최대 중량을 찾아 나가는게 아니라
+# 최대 중량을 설정하고 이게 되는지 안되는지 판단해야됌
+# 원래가 바텀업방식이라면 이건 탑다운 방식?  이 개념이 맞는지는 잘 모르겠다.
+import sys
+from _collections import deque
+n, m = map(int, input().split())
+
+def bfs(mid):
+
+    q = deque()
+    q.append(start_point)
+    visited[start_point] = 1
+
+    while q:
+        start = q.popleft()
+        if start == end_point:
+            return True
+        for n_node, n_cost in arr[start]:
+            if visited[n_node] == 0 and mid <= n_cost:
+                q.append(n_node)
+                visited[n_node] = 1
+    return False
+
+
+arr = [[] for _ in range(n+1)]
+
+for i in range(m):
+    a, b, c = map(int, input().split())
+    arr[a].append((b, c))
+    arr[b].append((a, c))
+
+start_point, end_point = map(int, input().split())
+
+
+left, right = 1, 1e9
+result = 0
+
+while left <= right:
+    visited = [0 for _ in range(n + 1)]
+    mid = (left + right) // 2
+    if bfs(mid): #중량이 통과했을때
+        left = mid + 1
+        result = mid
+    else: #중량 통과 못했을때
+        right = mid - 1
+
+print(int(result))

cmkim/BaekJoon/백준_2469.py

@@ -0,0 +1,57 @@
+
+k = int(input())
+n = int(input())
+
+
+
+start = list(map(chr, range(65, 65+k)))
+mid = []
+end = []
+end = list(map(str, input().strip()))
+
+arr = []
+
+for i in range(n):
+    temp = list(map(str, input().strip()))
+    if temp[0] == '?':
+        q_mark = i
+    arr.append(temp)
+
+
+# for i in range(n):
+#     print(arr[i])
+
+for i in range(0, q_mark):
+    for j in range(k-1):
+        if arr[i][j] == '-':
+            tempc = start[j]
+            start[j] = start[j+1]
+            start[j+1] = tempc
+
+for i in range(n-1, q_mark, -1):
+    for j in range(k-1):
+        if arr[i][j] == '-':
+            tempc = end[j]
+            end[j] = end[j+1]
+            end[j+1] = tempc
+
+# print(start)
+# print(end)
+
+for i in range(k-1):
+    if start[i] != end[i]:
+        if start[i] == end[i+1] and start[i+1] == end[i]:
+            mid.append('-')
+            tempc = start[i]
+            start[i] = start[i + 1]
+            start[i + 1] = tempc
+        else:
+            for finish in range(k-1):
+                print('x', end='')
+
+            quit()
+    else:
+        mid.append('*')
+
+for i in range(k-1):
+    print(mid[i], end='')

cmkim/BaekJoon/백준_3055.py

@@ -0,0 +1,48 @@
+import sys, math, heapq
+n = int(input())
+
+arr = []
+connected = []
+sum = 0
+cost = 1e9
+
+def dist(x1, y1, x2, y2):
+    return math.sqrt((x1 - x2)**2 + (y1 - y2)**2)
+
+for i in range(n):
+    x, y = map(float, input().split())
+    arr.append((x, y))
+
+q = []
+connected.append(0)
+for i in range(1, n):
+    heapq.heappush(q, (dist(arr[0][0], arr[0][1], arr[i][0], arr[i][1]), i))
+
+# print(connected)
+# print(q)
+
+while n != len(connected):
+    value, node = heapq.heappop(q)
+    while node in connected:
+        value, node = heapq.heappop(q)
+
+    sum += value
+    connected.append(node)
+
+    for i in range(n):
+        if i not in connected:
+            heapq.heappush(q, (dist(arr[node][0], arr[node][1], arr[i][0], arr[i][1]), i))
+
+print("%.2f"%(sum))
+
+
+
+
+
+
+
+
+
+
+
+

cmkim/BaekJoon/백준_4386.py

@@ -0,0 +1,28 @@
+import sys
+import heapq
+INF = 1e9
+n, m = map(int, input().split())
+arr = [[] * (n+1) for _ in range(n+1)]
+dis = [INF] * (n+1)
+
+for _ in range(m):
+    a, b, c = map(int, input().split())
+    arr[a].append((b, c))
+    arr[b].append((a, c))
+
+def dijkstra(start):
+    q = []
+    heapq.heappush(q, (0, start)) #비용, 출발점
+    dis[start] = 0
+    while q:
+        d, now = heapq.heappop(q)
+        if dis[now] < d:
+            continue
+        for v, w in arr[now]: # 가려는 곳에대한 위치, 비용
+            cost = d + w
+            if cost < dis[v]:
+                dis[v] = cost
+                heapq.heappush(q, (cost, v))
+
+dijkstra(1)
+print(dis[n])

cmkim/BaekJoon/백준_5972.py

@@ -0,0 +1,23 @@
+from _collections import deque
+
+def solution(n, computers):
+    answer = 0
+    visited = [False for i in range(n)]
+    for i in range(n):
+        if visited[i] == False:
+            bfs(n, computers, i, visited)
+            answer += 1
+
+    return answer
+
+def bfs(n, computers, i, visited):
+    visited[i] = True
+    q = deque()
+    q.append(i)
+    while len(q) > 0:
+        now = q.popleft()
+        visited[now] = True
+        for connect in range(n):
+            if connect != now and computers[now][connect] == 1:
+                if visited[connect] == False:
+                    q.append(connect)

cmkim/Programmers/DFS_BFS/네트워크.py

@@ -0,0 +1,27 @@
+from _collections import deque
+
+
+def solution(numbers, target):
+    answer = 0
+
+    q = deque()
+    q.append((0, 0))
+
+    while q:
+        value, index = q.popleft()
+
+        #print('value, index = ', value, index)
+
+        if index == len(numbers):
+            if value == target:
+                answer += 1
+
+        else:
+            temp = numbers[index]
+            q.append((value + temp, index + 1))
+            q.append((value - temp, index + 1))
+
+    return answer
+
+
+#print(solution([1, 1, 1, 1, 1], 3))