Merge branch 'main' into 30-yuna83

Author: yuna83

Munbin-Lee/README.md

@@ -32,5 +32,9 @@
 | 29차시 | 2024.01.19 |  유니온파인드  | <a href="https://www.acmicpc.net/problem/1043">거짓말</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/114 |
 | 30차시 | 2024.01.23 |  정수론  | <a href="https://www.acmicpc.net/problem/17425">약수의 합</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/118 |
 | 31차시 | 2024.01.27 |  이분탐색  | <a href="https://www.acmicpc.net/problem/2143">두 배열의 합</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/122 |
+| 32차시 | 2024.01.30 |  백트래킹  | <a href="https://www.acmicpc.net/problem/17114">하이퍼 토마토</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/124 |
 | 33차시 | 2024.02.04 |  정수론  | <a href="https://www.acmicpc.net/problem/14905">소수 4개의 합</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/128 |
+| 34차시 | 2024.02.06 |  구현  | <a href="https://www.acmicpc.net/problem/1756">피자 굽기</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/133 |
+| 35차시 | 2024.02.18 |  백트래킹  | <a href="https://www.acmicpc.net/problem/24891">단어 마방진</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/140 |
+| 36차시 | 2024.02.21 |  문자열  | <a href="https://www.acmicpc.net/problem/15927">회문은 회문아니야!!</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/143 |
 ---

Munbin-Lee/구현/34-피자 굽기.cpp

@@ -0,0 +1,43 @@
+#include <iostream>
+#include <stack>
+
+using namespace std;
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int D, N;
+    cin >> D >> N;
+
+    stack<int> minOvens;
+    int mn = 1087654321;
+
+    while (D--) {
+        int oven;
+        cin >> oven;
+
+        mn = min(mn, oven);
+        minOvens.emplace(mn);
+    }
+
+    while (N--) {
+        int pizza;
+        cin >> pizza;
+
+        while (!minOvens.empty() && minOvens.top() < pizza) {
+            minOvens.pop();
+        }
+
+        if (!minOvens.empty()) {
+            minOvens.pop();
+        } else {
+            cout << '0';
+            return 0;
+        }
+    }
+
+    cout << minOvens.size() + 1;
+
+    return 0;
+}

Munbin-Lee/문자열/36-회문은 회문아니야!!.cpp

@@ -0,0 +1,39 @@
+#include <iostream>
+#include <unordered_set>
+
+using namespace std;
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    string s;
+    cin >> s;
+
+    if (unordered_set<char>(s.begin(), s.end()).size() == 1) {
+        cout << "-1";
+        return 0;
+    }
+
+    auto isPalindrome = [](string &s) {
+        int lo = 0;
+        int hi = s.size() - 1; // NOLINT
+
+        while (lo < hi) {
+            if (s[lo] != s[hi]) return false;
+            lo++;
+            hi--;
+        }
+
+        return true;
+    };
+
+    if (!isPalindrome(s)) {
+        cout << s.size();
+        return 0;
+    }
+
+    cout << s.size() - 1;
+
+    return 0;
+}

Munbin-Lee/백트래킹/32-하이퍼 토마토.py

@@ -0,0 +1,71 @@
+from math import prod
+from collections import deque
+
+stdin = open(0)
+sizes = list(map(int, stdin.readline().split()))
+totalSize = prod(sizes)
+board = []
+unripe = 0
+index = 0
+deq = deque()
+
+for line in stdin.read().splitlines():
+    for num in map(int, line.split()):
+        board.append(num)
+        
+        if num == 0:
+            unripe += 1
+        
+        if num == 1:
+            deq.append(index)
+        
+        index += 1
+
+if unripe == 0:
+    print('0')
+    exit()
+
+def extract(x):
+    answer = [0] * 11
+    divisor = totalSize
+    
+    for i in range(10, -1, -1):
+        divisor //= sizes[i]
+        answer[i] = x // divisor
+        x %= divisor
+    
+    return answer
+
+def compress(ls):
+    answer = 0
+    coefficient = 1
+    
+    for i in range(0, 11):
+        answer += ls[i] * coefficient
+        coefficient *= sizes[i]
+    
+    return answer
+
+while deq:
+    cur = deq.popleft()
+    positions = extract(cur)
+    
+    for i in range(0, 11):
+        for offset in (-1, 1):
+            positions[i] += offset
+            
+            if 0 <= positions[i] < sizes[i]:
+                next = compress(positions)
+            
+                if board[next] == 0:
+                    board[next] = board[cur] + 1
+                    unripe -= 1
+                    deq.append(next)
+            
+            positions[i] -= offset
+        
+        if unripe == 0:
+            print(board[cur])
+            exit()
+
+print('-1')

Munbin-Lee/백트래킹/35-단어 마방진.py

@@ -0,0 +1,22 @@
+from itertools import permutations
+
+stdin = open(0)
+
+L, N = map(int, stdin.readline().split())
+words = sorted(stdin.read().splitlines())
+
+# 단어 순열 x가 단어 마방진인지 확인하는 함수
+def isValid(x):
+    for i in range(L):
+        for j in range(L):
+            if x[i][j] != x[j][i]: return False
+    
+    return True
+
+for perm in permutations(words, L):
+    if not isValid(perm): continue
+    
+    print(*perm, sep='\n')
+    exit()
+
+print('NONE')

pknujsp/BFS/32-숨바꼭질 3.py

@@ -0,0 +1,31 @@
+from sys import *
+from collections import *
+
+n, k = map(int, stdin.readline().strip().split())
+
+max_idx = 100001
+
+q = deque([(n, 0)])
+visited = [False] * max_idx
+visited[n] = True
+
+while q:
+    x, cost = q.popleft()
+    if x == k:
+        print(cost)
+        break
+
+    nx = x + x
+    if nx < max_idx and not visited[nx]:
+        visited[nx] = True
+        q.appendleft((nx, cost))
+
+    nx = x - 1
+    if 0 <= nx and not visited[nx]:
+        visited[nx] = True
+        q.append((nx, cost + 1))
+
+    nx = x + 1
+    if nx < max_idx and not visited[nx]:
+        visited[nx] = True
+        q.append((nx, cost + 1))

pknujsp/README.md

@@ -32,4 +32,5 @@
 | 28차시 | 2024.01.16 |     그리디      |       [무지의 먹방 라이브](https://school.programmers.co.kr/learn/courses/30/lessons/42891)       | [#110](https://github.com/lgoLeadMe/AlgoLeadMe-1/pull/110) |
 | 29차시 | 2024.01.18 | DFS, UNION-FIND |                       [순열 사이클](https://www.acmicpc.net/problem/10451)                        | [#112](https://github.com/lgoLeadMe/AlgoLeadMe-1/pull/112) |
 | 30차시 | 2024.01.23 |       DP        |                           [ABBC](https://www.acmicpc.net/problem/25381)                           | [#119](https://github.com/lgoLeadMe/AlgoLeadMe-1/pull/119) |
-| 31차시 | 2024.01.30 |       SORT        |                          [멀티버스 Ⅱ](https://www.acmicpc.net/problem/18869)                           | [#123](https://github.com/lgoLeadMe/AlgoLeadMe-1/pull/123) |
+| 31차시 | 2024.01.30 |      SORT       |                        [멀티버스 Ⅱ](https://www.acmicpc.net/problem/18869)                        | [#123](https://github.com/lgoLeadMe/AlgoLeadMe-1/pull/123) |
+| 32차시 | 2024.02.04 |       BFS       |                        [숨바꼭질 3](https://www.acmicpc.net/problem/13549)                        | [#127](https://github.com/lgoLeadMe/AlgoLeadMe-1/pull/127) |

tgyuuAn/BFS/교환.py

@@ -0,0 +1,47 @@
+from collections import Counter
+
+number, exchange_count = map(int,input().split())
+
+number = list(str(number))
+answer = "0"
+
+counter = Counter(number)
+same_number_flag = False
+
+for key, value in counter.items():
+    if value >=2:
+        same_number_flag = True 
+        break
+
+def dfs(number, depth, remain_exchange_count, same_number_flag):
+    global answer
+
+    if remain_exchange_count == 0:
+        answer = max(answer, "".join(number))
+        return
+
+    flag = False
+    for prev_idx in range(depth,len(number)):
+        for next_idx in range(prev_idx+1, len(number)):
+            if number[next_idx] >= number[prev_idx]:
+                number[next_idx], number[prev_idx] = number[prev_idx], number[next_idx]
+                dfs(number, depth+1, remain_exchange_count-1, same_number_flag)
+                number[next_idx], number[prev_idx] = number[prev_idx], number[next_idx]
+                flag = True
+
+    if flag == False:
+        if same_number_flag: dfs(number, depth+1, remain_exchange_count-1, same_number_flag)
+        else:
+            number[-1], number[-2] = number[-2], number[-1]
+            dfs(number, depth+1, remain_exchange_count-1, same_number_flag)
+            number[-1], number[-2] = number[-2], number[-1]
+
+if len(number) == 1 and exchange_count >= 1:
+    print("-1")
+
+elif len(number) == 2 and "0" in number:
+    print("-1")
+
+else:
+    dfs(number,0, exchange_count, same_number_flag)
+    print(answer)

tgyuuAn/DP/앱.py

@@ -0,0 +1,16 @@
+total_app_count, need_memory = map(int,input().split())
+
+use_memory = list(map(int,input().split()))
+re_use_cost = list(map(int,input().split()))
+
+dp_table = [0 for _ in range(sum(re_use_cost)+1)]
+cost_sum = sum(re_use_cost)
+
+for memory, cost in zip(use_memory, re_use_cost):
+    for idx in range(cost_sum,cost-1,-1):
+        dp_table[idx] = max(dp_table[idx], dp_table[idx-cost] + memory)
+
+for idx, memory in enumerate(dp_table):
+    if memory >= need_memory: 
+        print(idx)
+        break

tgyuuAn/DP/입대.py

@@ -0,0 +1,30 @@
+import sys
+
+remain_days, need_score = map(int,sys.stdin.readline().split())
+volunteer_scores = [0]
+volunteer_scores.extend(list(map(int,sys.stdin.readline().split())))
+
+blood_donation_score, blood_donation_break_time = map(int,sys.stdin.readline().split())
+
+volunteer_scores.extend([0 for _ in range(blood_donation_break_time-1)])
+maximum_blood_donation_count = (len(volunteer_scores)+blood_donation_break_time-1)//blood_donation_break_time+1
+
+dp_table = [[0 for _ in range(maximum_blood_donation_count)] for _ in range(len(volunteer_scores))]
+
+for date in range(len(volunteer_scores)):
+    if date >= blood_donation_break_time:
+        for blood_donation_count in range(1,maximum_blood_donation_count):
+            dp_table[date][blood_donation_count] = max(dp_table[date][blood_donation_count],
+                                                       dp_table[date-1][blood_donation_count] + volunteer_scores[date],
+                                                       dp_table[date-blood_donation_break_time][blood_donation_count-1] + blood_donation_score)
+
+    dp_table[date][0] = dp_table[date-1][0] + volunteer_scores[date]
+
+print(dp_table)
+
+for count in range(len(dp_table[-1])):
+    if dp_table[-1][count] >= need_score:
+        print(count)
+        break
+
+else: print(-1)

tgyuuAn/DP/피보나치 수 3.py

@@ -0,0 +1,16 @@
+target = int(input())
+
+M = 1_000_000
+period = 1_500_000
+
+target %= period
+
+dp_table = [0 for _ in range(3)]
+dp_table[0] = 0
+dp_table[1] = 1
+
+for idx in range(2,target+1):
+    idx %= 3
+    dp_table[idx] = dp_table[idx-1] % M + dp_table[idx-2] % M
+
+print(dp_table[target%3]%M)

tgyuuAn/README.md

@@ -38,4 +38,8 @@
 | 34차시 | 2023.01.22 |  힙  | <a href="https://www.acmicpc.net/problem/1655">가운데를 말해요</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/116
 | 35차시 | 2023.01.25 |  이분 탐색  | <a href="https://www.acmicpc.net/problem/2110">공유기 설치</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/120
 | 36차시 | 2023.02.04 |  BFS  | <a href="https://www.acmicpc.net/problem/4991">로봇 청소기</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/126
+| 37차시 | 2023.02.04 |  BFS  | <a href="https://www.acmicpc.net/problem/1039">교환</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/131
+| 38차시 | 2023.02.15 |  DP  | <a href="https://www.acmicpc.net/problem/2749">피보나치 수 3</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/137
+| 39차시 | 2023.02.18 |  DP  | <a href="https://www.acmicpc.net/problem/7579">앱</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/139
+| 40차시 | 2023.02.21 |  DP  | <a href="https://www.acmicpc.net/problem/31413">입대</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/142
 ---

yuna83/DFS/바이러스.py

@@ -0,0 +1,21 @@
+cnt=0
+def DFS(virus):
+    global cnt
+    visited[virus]=1
+
+    for i in network[virus]:
+        if (visited[i]==0):
+            DFS(i)
+            cnt+=1
+
+N= int(input())
+link = int(input())
+
+network = [[]*(N+1) for _ in range(N+1)]
+for i in range(link):
+    a, b = map(int, input().split())
+    network[a].append(b)
+    network[b].append(a)
+visited = [0]*(N+1)
+DFS(1)
+print(cnt)

yuna83/README.md

@@ -32,4 +32,6 @@
 | 28차시 | 2024.02.07 |  투포인터  | [구명보트](https://school.programmers.co.kr/learn/courses/30/lessons/42885)|https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/134|
 | 29차시 | 2024.02.13 |  슬라이딩윈도우  | [블로그](https://www.acmicpc.net/problem/21921)|https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/136|
 | 29차시 | 2024.02.19 |  슬라이딩윈도우  | [도둑](https://www.acmicpc.net/problem/13422)|https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/141|
+| 30차시 | 2024.02.19 |  슬라이딩윈도우  | [도둑](https://www.acmicpc.net/problem/13422)|https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/141|
+| 31차시 | 2024.02.23 |  DFS/BFS  | [바이러스](https://www.acmicpc.net/problem/2606)|https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/145|
 ---