13-H0ngJu

H0ngJu/BFS/숨바꼭질4.py

@@ -0,0 +1,33 @@
+import sys
+from collections import deque
+
+def input(): return sys.stdin.readline()
+
+N, K = map(int, input().split())
+
+visited = [0] * 100001
+time = 0
+parent = [-1] * 100001
+
+q = deque([N])
+visited[N] = 1
+
+while q:
+    size = len(q)
+    for _ in range(size):
+        location = q.popleft()
+        if location == K: 
+            print(time)
+            answer = []
+            while location != -1:
+                answer.append(location)
+                location = parent[location]
+            answer.reverse()
+            print(" ".join(map(str, answer)))
+            break
+        for next_location in (location + 1, location - 1, location * 2):
+            if 0 <= next_location <= 100000 and not visited[next_location]:
+                q.append(next_location)
+                visited[next_location] = 1
+                parent[next_location] = location
+    time += 1

H0ngJu/DFS/ABCDE.py

@@ -0,0 +1,43 @@
+import sys
+
+def input(): return sys.stdin.readline().rstrip()
+
+# 재귀함수 fr_check 
+def fr_check(friend, stack):
+    stack.append(friend)  # 현재 친구를 스택에 추가
+    print(stack)
+
+    if len(stack) == 5: # 친구 5명 되면 
+        return stack
+
+    for x in friends[friend]:
+        if x not in stack:
+            result = fr_check(x, stack.copy()) # 복사해야 별도의 stack이 만들어져서 전달 가능
+            if result is not None:
+                return result
+
+    return None # stack이 5가 되지 않은 경우
+
+
+N, M = map(int, input().split())
+friends = [[] for _ in range(N)] #freind[i]에는 i의 친구 담기
+fcheck = 0
+stack = []
+
+
+for _ in range(M):
+    f0, f1 = map(int, input().split())
+    friends[f0].append(f1)
+    friends[f1].append(f0)
+
+
+for idx in range(N):
+    stack = []
+    result = fr_check(idx, stack) #idx부터 체크 시작
+    if result != None and len(result) == 5:
+        fcheck = 1
+        print("1")
+        break
+
+if fcheck == 0:
+    print(0)

H0ngJu/DP/1,2,3 더하기.py

@@ -0,0 +1,26 @@
+import sys
+
+def input(): return sys.stdin.readline().strip()
+
+T = int(input())
+
+answer = []
+dp = [0] * (11)
+
+for index in range(T):
+    data = int(input())
+
+    for i in range(1, data + 1):
+        if i == 1:
+            dp[i] = 1
+        elif i == 2:
+            dp[i] = 2
+        elif i == 3:
+            dp[i] = 4
+        else:
+            dp[i] = dp[i-1] + dp[i-2] + dp[i-3]
+
+    answer.append(dp[data])
+
+for a in answer:
+    print(a, end=" ")

H0ngJu/DP/RGB거리 2.py

@@ -0,0 +1,21 @@
+import sys
+
+def input(): return sys.stdin.readline().rstrip()
+
+N = int(input())
+INF = 1000*1000+1
+
+house = [[int(x) for x in input().split()] for _ in range(N)]
+cost = INF
+
+for first_house in range(3):
+    dp = [[INF] * 3 for _ in range(N)]
+    dp[0][first_house] = house[0][first_house]  
+    for i in range(1, N):
+        dp[i][0] = min(dp[i-1][1], dp[i-1][2]) + house[i][0]
+        dp[i][1] = min(dp[i-1][0], dp[i-1][2]) + house[i][1] 
+        dp[i][2] = min(dp[i-1][0], dp[i-1][1]) + house[i][2]
+    dp[N-1][first_house] = INF
+    cost = min(cost, min(dp[N-1]))
+
+print(cost)

H0ngJu/DP/쉬운 계단 수.py

@@ -0,0 +1,28 @@
+import sys
+
+DIV = 1_000_000_000
+
+N = int(sys.stdin.readline().rstrip())
+
+dp = [[0] * 10 for _ in range(N+1)] 
+answer = 0
+
+for i in range(1,N+1):
+    if i == 1:
+        for k in range(1,10):
+            dp[i][k] = 1
+
+    else:
+        for num in range(10):
+            if num == 0:
+                dp[i][num] = dp[i-1][1]%DIV
+            elif num == 9:
+                dp[i][num] = dp[i-1][8]%DIV
+            else:
+                dp[i][num] = (dp[i-1][num-1] + dp[i-1][num+1])%DIV
+
+for k in range(10):
+    answer += dp[N][k]
+
+print(answer%DIV)
+

H0ngJu/README.md

@@ -1,6 +1,19 @@
-## ✏️ 기록   
+## ✏️ 기록
+
+|  차시  |    날짜    | 문제유형 |                                         링크                                          |                        풀이                         |
+| :----: | :--------: | :------: | :-----------------------------------------------------------------------------------: | :-------------------------------------------------: |
+| 1차시  | 2024.03.05 |    큐    |      [프로세스](https://school.programmers.co.kr/learn/courses/30/lessons/42587)      | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/151 |
+| 2차시  | 2024.03.07 |    큐    | [다리를 지나는 트럭](https://school.programmers.co.kr/learn/courses/30/lessons/42583) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/153 |
+| 3차시  | 2024.03.10 |    힙    |                  [N번째 큰 수](https://www.acmicpc.net/problem/2075)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/156 |
+| 4차시  | 2024.03.13 |    힙    |                    [문제집](https://www.acmicpc.net/problem/1766)                     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/158 |
+| 5차시  | 2024.03.16 |   구현   |                 [요세푸스 문제](https://www.acmicpc.net/problem/1158)                 | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/161 |
+| 6차시  | 2024.03.19 |   스택   |                    [오큰수](https://www.acmicpc.net/problem/17298)                    | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/164 |
+| 7차시  | 2024.03.22 |    DP    |                 [1,2,3 더하기](https://www.acmicpc.net/problem/9095)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/166 |
+| 8차시  | 2024.03.16 |    DP    |                 [쉬운 계단 수](https://www.acmicpc.net/problem/10844)                 | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/170 |
+| 9차시  | 2024.03.22 |    DP    |                  [RGB거리 2](https://www.acmicpc.net/problem/17404)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/172 |
+| 10차시 | 2024.04.03 |   BFS    |                  [숨바꼭질 4](https://www.acmicpc.net/problem/13913)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/177 |
+| 11차시 | 2024.04.07 |   구현   |                   [사탕 게임](https://www.acmicpc.net/problem/9095)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/178 |
+| 12차시 | 2024.04.09 |   DFS    |                    [ABCDE](https://www.acmicpc.net/problem/13023)                     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/180 |
+| 13차시 | 2024.05.06 | 완전탐색 |                    [리모컨](https://www.acmicpc.net/problem/1107)                     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/181 |
 
-| 차시 |    날짜    | 문제유형 | 링크 | 풀이 |
-|:----:|:---------:|:----:|:-----:|:----:|
-| 1차시 | 2024.03.04 |  BFS  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/169199">리코쳇 로봇</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/1 |
 ---

H0ngJu/구현/사탕 게임.py

@@ -0,0 +1,44 @@
+import sys
+
+def input(): return sys.stdin.readline().rstrip()
+
+def eat(row, col):
+    row_cnt = 0
+    col_cnt = 0
+    tmp_col = 1
+    tmp_row = 1
+    for idx in range(N-1):
+        # 열에서 먹을 때
+        if data[row][idx] == data[row][idx+1]:
+            tmp_col += 1
+            col_cnt = max(col_cnt, tmp_col)
+        else:
+            tmp_col = 1
+
+        # 행에서 먹을 때
+        if data[idx][col] == data[idx+1][col]:
+            tmp_row += 1
+            row_cnt = max(row_cnt, tmp_row)
+        else:
+            tmp_row = 1
+
+    return max(row_cnt, col_cnt)
+
+
+N = int(input())
+data = [[x for x in input()] for _ in range(N)]
+directions = [(0,-1), (0,1), (-1,0),(1,0)]
+cnt = 0
+
+for i in range(N):
+    for k in range(N):
+        for dir in directions:
+            dx, dy = dir
+            x = i+dx
+            y = k+dy
+            if 0<=x<N and 0<=y<N:
+                data[i][k], data[x][y] = data[x][y], data[i][k]
+                cnt = max(cnt, eat(x,y))
+                data[i][k], data[x][y] = data[x][y], data[i][k] #다시 되돌리기
+
+print(cnt)

H0ngJu/구현/요세푸스.py

@@ -0,0 +1,27 @@
+import sys
+
+def input(): 
+    return sys.stdin.readline().rstrip()
+
+def solution(k):
+    location = 0
+    cnt = 0
+
+    while table:
+        if cnt == k - 1:
+            answer.append(table.pop(location))
+            location -= 1 # 삭제한 경우에는 위치를 앞으로 이동
+            cnt = 0
+        else:
+            cnt += 1
+        if len(table) != 0:
+            location = (location + 1) % len(table)
+
+    return answer
+
+n, k = map(int, input().split())
+table = [i + 1 for i in range(n)]
+answer = []
+
+solution(k)
+print("<" + ", ".join(map(str, answer)) + ">")

H0ngJu/스택/오큰수.py

@@ -0,0 +1,25 @@
+import sys
+from collections import *
+
+def input(): return sys.stdin.readline().strip()
+N = int(input())
+
+arr = list(map(int, input().split()))
+arr.reverse()
+answer = [-1 for _ in range(N)]
+
+id = 0
+
+stack = []
+stack.append((id,arr.pop()))
+
+while arr:
+    id += 1
+    arr_data = arr.pop()
+    while stack and stack[-1][1] < arr_data:
+        index, data = stack.pop()
+        answer[index] = arr_data
+    stack.append((id, arr_data))
+
+for i in answer:
+    print(i, end=" ")

H0ngJu/완전탐색/리모컨.py

@@ -0,0 +1,22 @@
+import sys
+
+def input(): return sys.stdin.readline().rstrip()
+
+N = int(input())
+M = int(input())
+btn = list(map(int, input().rsplit()))
+
+target = abs(N-100)
+cnt = target
+
+for i in range(1000001):
+    check = True
+    for str_i in str(i):
+        if int(str_i) in btn:
+            check = False
+            break
+
+    if check:
+        cnt = min(cnt, abs(i - N)+len(str(i)))
+
+print(cnt)

H0ngJu/큐/process.py

@@ -0,0 +1,20 @@
+from collections import deque
+
+def solution(priorities, location):
+    answer = 0
+    queue = deque([(i, k) for k, i in enumerate(priorities)]) # 튜플 큐 생성
+    priorities.sort(reverse=True) # 내림차순 정렬
+
+    while queue:
+        cur = queue.popleft() # 가장 앞의 프로세스 꺼내기 (queue.pop(0)) 
+        if cur[0] == priorities[0]: # 내림차순으로 정렬된 우선순위 == 현재 순위 -> 가장 높음
+            answer += 1 # 수 ++
+            if cur[1] == location: # 찾고자하는 process인 경우
+                break
+            priorities.pop(0)
+        else:
+            queue.append(cur) # 뒤로 미루기
+
+    return answer
+
+#test

H0ngJu/큐/다리를 지나는 트럭.py

@@ -0,0 +1,26 @@
+from collections import deque
+
+def solution(bridge_length, weight, truck_weights):
+    time = 0
+    onBridge = deque() # 현재 다리 위에 있는 트럭
+    truckNum = 0 # 현재 다리 위에 있는 트럭 수
+    sum = 0 # 현재 다리 위에 있는 트럭 무게의 합
+    truck_weights = deque(truck_weights)
+
+    while truck_weights or onBridge:
+        time += 1
+
+        # 트럭이 다리를 지나가는 경우 처리
+        if onBridge and time - onBridge[0][1] >= bridge_length:
+            sum -= onBridge.popleft()[0]
+            truckNum -= 1
+
+        # 다음 트럭이 다리에 올라갈 수 있는 경우 처리
+        # 트럭이 있고 합이 weight을 넘지 않으며, 수가 bridge_length를 넘기지 않는 경우
+        if len(truck_weights) != 0 and sum + truck_weights[0] <= weight and truckNum + 1 <= bridge_length:
+            truck = truck_weights.popleft() # pop
+            onBridge.append((truck, time)) # 다리 위의 truck에 tuple 추가
+            sum += truck # 무게 추가
+            truckNum += 1 # 건너고 있는 트럭 추가
+
+    return time

H0ngJu/힙/N번째 큰 수.py

@@ -0,0 +1,19 @@
+import sys
+import heapq
+
+line = int(sys.stdin.readline().strip())
+
+heap = []
+heapq.heapify(heap)
+
+for i in range(line):
+    data = list(map(int, sys.stdin.readline().strip().split()))
+    for s in data:
+        if len(heap) < line:
+            heapq.heappush(heap, s)
+        else:
+            if s > heap[0]:
+                heapq.heappop(heap)
+                heapq.heappush(heap, s)
+
+print(heap[0])