Merge branch 'main' into 58-tgyuuAn

H0ngJu/BFS/적록색약.py

@@ -0,0 +1,46 @@
+import sys
+sys.setrecursionlimit(10**6)
+from collections import deque
+
+def input(): return sys.stdin.readline().rstrip()
+
+N = int(input())
+arr = [[i for i in input()]for _ in range(N)]
+visited = [[0] * N for _ in range(N)]
+direc = [(1,0), (-1,0), (0,1), (0,-1)]
+result = [0, 0]
+
+def bfs(x, y, color):
+    q = deque([(x,y)])
+    visited[x][y] = 1
+    while q:
+        cx, cy = q.popleft()
+        for dx, dy in direc:
+            nx = dx + cx
+            ny = dy + cy
+            if 0 <= nx < N and 0 <= ny < N and not visited[nx][ny] and arr[nx][ny] == color:
+                q.append((nx, ny))
+                visited[nx][ny] = 1
+
+
+for i in range(N):
+    for j in range(N):
+        if not visited[i][j]:
+            bfs(i,j,arr[i][j])
+            result[0] += 1
+
+visited = [[0] * N for _ in range(N)]
+
+for i in range(N):
+    for j in range(N):
+        if arr[i][j] == "R":
+            arr[i][j] = "G"
+
+for i in range(N):
+    for j in range(N):
+        if not visited[i][j]:
+            bfs(i,j,arr[i][j])
+            result[1] += 1
+
+
+print(result[0], result[1], end=" ")

H0ngJu/DFS/계란으로 계란치기.py

@@ -0,0 +1,39 @@
+import sys
+sys.setrecursionlimit(10**6)
+
+def input(): return sys.stdin.readline().rstrip()
+
+N = int(input())
+eggs = [list(map(int, input().split())) for _ in range(N)]
+
+def break_egg(idx):
+    cnt = 0
+
+    # idx가 넘어간 경우
+    if idx == N:
+        for i in range(N):
+            if eggs[i][0] <= 0:
+                cnt += 1
+        return cnt
+
+    if eggs[idx][0] <= 0: # 들고 있는 계란이 깨진 경우
+        return break_egg(idx+1)
+
+    broken = False
+    for j in range(N): # 계란 깨기
+        if j != idx and eggs[j][0] > 0:
+            broken = True
+            eggs[idx][0] -= eggs[j][1]
+            eggs[j][0] -= eggs[idx][1]
+
+            cnt = max(cnt, break_egg(idx+1))
+
+            eggs[idx][0] += eggs[j][1]
+            eggs[j][0] += eggs[idx][1]
+
+    if not broken:
+        return break_egg(idx+1)
+
+    return cnt
+
+print(break_egg(0))

H0ngJu/README.md

@@ -18,5 +18,7 @@
 | 14차시 | 2024.05.09 |   DFS    |                   [치킨배달](https://www.acmicpc.net/problem/15686)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/183 |
 | 15차시 | 2024.05.14 |  그리디  |                    [A와 B](https://www.acmicpc.net/problem/12904)                     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/188 |
 | 16차시 | 2024.05.14 |   BFS    |               [뱀과 사다리 게임](https://www.acmicpc.net/problem/16928)               | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/191 |
+| 17차시 | 2024.05.22 |   BFS    |                   [적록색약](https://www.acmicpc.net/problem/10026)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/195 |
+| 17차시 | 2024.05.26 |   DFS    |              [계란으로 계란치기](https://www.acmicpc.net/problem/16987)               | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/199 |
 
 ---

SeongHoonC/README.md

@@ -26,4 +26,6 @@
 | 22차시 | 2024.05.01 | DP | <a href="https://www.acmicpc.net/problem/11053">가장 긴 증가하는 부분 수열</a> |https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/80 |
 | 23차시 | 2024.05.14 | 소수 | <a href="https://www.acmicpc.net/problem/1644">소수의 연속합</a> |https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/186 |
 | 24차시 | 2024.05.18| 백트래킹 | <a href="https://www.acmicpc.net/problem/9663">n-queen</a> |https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/192 |
+| 25차시 | 2024.05.22| 브루트포스 | <a href="https://www.acmicpc.net/problem/14500">테트로미노</a> |https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/194 |
+| 26차시 | 2024.05.26| 그래프 | <a href="https://www.acmicpc.net/problem/1389">케빈 베이컨의 6단계 법칙</a> |https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/200 |
 ---

SeongHoonC/graph/캐빈베이컨.kt

@@ -0,0 +1,40 @@
+import java.io.BufferedReader
+import java.io.InputStreamReader
+
+private const val INF = 987_654_321
+fun main() {
+    val br = BufferedReader(InputStreamReader(System.`in`))
+    val (n, m) = br.readLine().split(" ").map { it.toInt() }
+    val graph = Array(n + 1) { i ->
+        Array(n + 1) { j -> if (i == j) 0 else INF }
+    }
+
+    repeat(m) {
+        val (a, b) = br.readLine().split(" ").map { it.toInt() }
+        graph[a][b] = 1
+        graph[b][a] = 1
+    }
+
+    for (k in 1..n) {
+        for (i in 1..n) {
+            for (j in 1..n) {
+                if (graph[i][j] > graph[i][k] + graph[k][j]) {
+                    graph[i][j] = graph[i][k] + graph[k][j]
+                }
+            }
+        }
+    }
+
+    var min = INF
+    var answer = -1
+
+    for (i in 1..n) {
+        val sum = (1..n).sumOf { j -> graph[i][j] }
+        if (min > sum) {
+            min = sum
+            answer = i
+        }
+    }
+
+    println(answer)
+}

SeongHoonC/브루트포스/테트로미노.kt

@@ -0,0 +1,73 @@
+import java.io.BufferedReader
+import java.io.InputStreamReader
+import kotlin.math.max
+
+val t1 = listOf(0 to 0, 0 to 1, 0 to 2, 0 to 3)
+val t2 = listOf(0 to 0, 0 to 1, 1 to 0, 1 to 1)
+val t3 = listOf(0 to 0, 1 to 0, 2 to 0, 2 to 1)
+val t4 = listOf(0 to 0, 1 to 0, 1 to 1, 2 to 1)
+val t5 = listOf(0 to 0, 0 to 1, 0 to 2, 1 to 1)
+val tetrominos = listOf(t1, t2, t3, t4, t5)
+
+private var n: Int = 0
+private var m: Int = 0
+private lateinit var board: Array<Array<Int>>
+fun main() {
+    val br = BufferedReader(InputStreamReader(System.`in`))
+    val input = br.readLine().split(" ").map { it.toInt() }
+    n = input[0]
+    m = input[1]
+
+    board = Array(n) { Array(m) { 0 } }
+    // 숫자를 보드에 세팅
+    repeat(n) {
+        val line = br.readLine().split(" ").map { it.toInt() }
+        line.forEachIndexed { index, value -> board[it][index] = value }
+    }
+
+    var maxTetromino = 0
+
+    // 0,0 부터 n-1, m-1 까지 탐색
+    for (x in 0 until n) {
+        for (y in 0 until m) {
+            tetrominos.forEach { tetromino ->
+                // 그대로
+                maxTetromino = max(maxTetromino, sumAllDirection(x, y, tetromino))
+                // 뒤집어서
+                maxTetromino = max(maxTetromino, sumAllDirection(x, y, tetromino.reverseTetromino()))
+            }
+        }
+    }
+    println(maxTetromino)
+}
+
+// 90도씩 회전시켜 최대값 return
+private fun sumAllDirection(x: Int, y: Int, tetromino: List<Pair<Int, Int>>): Int {
+    var maxTetromino = 0
+    var nowTetromino = tetromino
+    repeat(4) {
+        maxTetromino = max(maxTetromino, sumTetromino(x, y, nowTetromino))
+        nowTetromino = nowTetromino.translate()
+    }
+    return maxTetromino
+}
+
+// board 의 tetromino 숫자 합 계산
+private fun sumTetromino(x: Int, y: Int, tetromino: List<Pair<Int, Int>>): Int {
+    var sum = 0
+    for (move in tetromino) {
+        val nowX = x + move.first
+        val nowY = y + move.second
+        if (nowX >= n || nowY >= m || nowX < 0 || nowY < 0) {
+            return -1
+        }
+        sum += board[nowX][nowY]
+    }
+    return sum
+}
+
+// tetromino 를 90도 회전
+private fun List<Pair<Int, Int>>.translate() = map { it.second to -1 * it.first }
+
+// tetromino 를 뒤집기
+private fun List<Pair<Int, Int>>.reverseTetromino() = map { it.first to (it.second * -1) }

alstjr7437/README.md

@@ -26,4 +26,6 @@
 | 22차시 | 2024.04.13 |  BFS  | <a href="https://www.acmicpc.net/problem/11724">연결 요소의 개수</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/78 |
 | 23차시 | 2024.05.01 |  큐  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/42587">프로세스</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/79 |
 | 24차시 | 2024.05.14 |  BFS  | <a href="https://www.acmicpc.net/problem/7576">토마토</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/187 |
-| 25차시 | 2024.05.18 |  덱  | <a href="https://www.acmicpc.net/problem/5430">AC</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/190 |
+| 25차시 | 2024.05.18 |  덱  | <a href="https://www.acmicpc.net/problem/5430">AC</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/190 |
+| 26차시 | 2024.05.22 |  정렬  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/42747">H-Index</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/196 |
+| 27차시 | 2024.05.26 |  우선순위 큐  | <a href="https://www.acmicpc.net/problem/7662">이중 우선순위 큐</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/198 |

alstjr7437/우선순위-큐/이중-우선순위-큐.py

@@ -0,0 +1,47 @@
+from heapq import *
+import sys
+
+input = sys.stdin.readline
+
+t = int(input())
+
+for _ in range(t):
+    q = int(input())
+
+    # 최소힙만 지원해서 최대, 최소 만들어주기
+    min_heap = []
+    max_heap = []
+    nums = [False] * q  # 동기화를 위한 부분
+
+    for i in range(q):
+        k = list(input().split())
+        iNum = int(k[1])  
+
+        # 입력 부분
+        if k[0] == "I" :
+            heappush(min_heap, (iNum,i))    # 동기화를 위한 i도 튜플로 넣어주기
+            heappush(max_heap, (-iNum, i))
+            nums[i] = True
+        elif iNum == 1:
+            while max_heap and not nums[max_heap[0][1]]:   
+                heappop(max_heap)
+            if max_heap:     # max_heap에서 작은 수 제거
+                nums[max_heap[0][1]] = False 
+                heappop(max_heap)
+        else:
+            while min_heap and not nums[min_heap[0][1]]:    # 이미 삭제된 노드인 경우 삭제되지 않은 노드 나올때까지 모두 버림
+                heappop(min_heap)
+            if min_heap:    # min_heap에서 작은 수(삭제 노드) 제거
+                nums[min_heap[0][1]] = False
+                heappop(min_heap)
+        # print(min_heap, max_heap, nums, k)
+    # 모든 연산 후 동기화 되지 않은 노드 처리
+    while min_heap and not nums[min_heap[0][1]]:
+        heappop(min_heap)
+    while max_heap and not nums[max_heap[0][1]]:
+        heappop(max_heap)
+
+    if max_heap and min_heap :
+        print(-max_heap[0][0], min_heap[0][0])
+    else :
+        print("EMPTY")

alstjr7437/정렬/H-Index.py

@@ -0,0 +1,8 @@
+def solution(citations):
+    citations.sort(reverse=True)  
+
+    for i in range(len(citations)):
+        if(citations[i] < i+1):    
+            return i
+
+    return len(citations) 

tgyuuAn/README.md

@@ -60,5 +60,7 @@
 | 53차시 | 2024.05.09 |  백트래킹  | <a href="https://www.acmicpc.net/problem/12100">2048 (Easy)</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/184
 | 54차시 | 2024.05.14 |  다익스트라  | <a href="https://www.acmicpc.net/problem/9370">미확인 도착지</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/185
 | 55차시 | 2023.05.18 |  유니온 파인드  | <a href="https://www.acmicpc.net/problem/4195">친구 네트워크</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/189
+| 56차시 | 2023.05.18 |  BFS | <a href="https://www.acmicpc.net/problem/17836">공주님을 구해라!</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/193
+| 57차시 | 2023.05.26 |  분할 정복  | <a href="https://www.acmicpc.net/problem/2263">트리의 순회</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/197
 | 58차시 | 2023.05.30 |  백트래킹  | <a href="https://www.acmicpc.net/problem/1799">비숍</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/204
 ---

tgyuuAn/분할 정복/트리의 순회.py

@@ -0,0 +1,27 @@
+import sys
+
+sys.setrecursionlimit(10**6)
+def input(): return sys.stdin.readline().rstrip()
+
+N = int(input())
+in_order = list(map(int,input().split()))
+post_order = list(map(int,input().split()))
+position = [0 for _ in range(N+1)]
+
+for idx, element in enumerate(in_order):
+    position[element] = idx
+
+def divide_and_conquer(in_start, in_end, post_start, post_end):
+    if in_start > in_end or post_start > post_end: return
+
+    in_order_root = post_order[post_end]
+    print(in_order_root, end=" ")
+
+    root_idx = position[in_order_root]
+
+    divide_and_conquer(in_start, root_idx-1, post_start, post_start+(root_idx - in_start) -1)
+    divide_and_conquer(root_idx+1, in_end, post_start+(root_idx - in_start), post_end-1)
+
+    return
+
+divide_and_conquer(0, N-1, 0, N-1)

tgyuuAn/힙/공주님을 구해라!.py

@@ -0,0 +1,43 @@
+from heapq import *
+import sys
+
+def input(): return sys.stdin.readline().rstrip()
+
+N, M, T = map(int, input().split())
+board = []
+
+for _ in range(N):
+    board.append(input().split())
+
+dx = [0, 0, -1, 1]
+dy = [-1, 1, 0, 0]
+heap = [(0, 0, 0)]
+answer = int(1e9)
+visited = {(0,0),}
+while heap:
+    now_time, now_row, now_col = heappop(heap)
+
+    if now_row == N-1 and now_col == M-1:
+        answer = min(answer, now_time)
+        break
+
+    if now_time >= T: continue
+
+    for dir in range(4):
+        new_row = now_row + dy[dir]
+        new_col = now_col + dx[dir]
+
+        if new_row < 0 or new_row >= N: continue
+        if new_col < 0 or new_col >= M: continue
+        if (new_row, new_col) in visited: continue
+
+        if board[new_row][new_col] == "2":
+            heappush(heap, (now_time+1, new_row, new_col))
+            answer = min(answer, (now_time+1+(N-1-new_row)+(M-1-new_col)))
+
+        elif board[new_row][new_col] == "0":
+            heappush(heap, (now_time+1, new_row, new_col))
+
+        visited.add((new_row, new_col))
+
+print(answer) if answer <= T else print("Fail")