Merge pull request #158 from zaqquum/main

Hongjoo/3월 4주차 / 3개

Author: zaqquum

Hongjoo/백준/계단수.py

@@ -0,0 +1,31 @@
+"""
+https://www.acmicpc.net/problem/1562
+"""
+N = int(input())
+MOD = 1e9
+# dp[N번째 수][마지막 수][방문한 수 bitmasking(0~1023)]
+dp = [[[0]*1024 for _ in range(10)] for _ in range(N+1)]
+ 
+for i in range(1, 10):
+    dp[1][i][1<<i] = 1
+ 
+# n = N번째 수
+for n in range(2, N+1):
+    # i = 마지막 방문 숫자가 i
+    for i in range(10):
+        # 0~9까지 모든 수를 방문해야 한다는 조건이 있으므로, 방문 여부를 bitmasking을 통해 저장해야 함.
+        for bit in range(1024):
+            if i == 0:
+                dp[n][i][bit | (1<<i)] += dp[n-1][i+1][bit]
+            elif i == 9:
+                dp[n][i][bit | (1<<i)] += dp[n-1][i-1][bit]
+            else:
+                dp[n][i][bit | (1<<i)] += dp[n-1][i-1][bit] + dp[n-1][i+1][bit]
+            
+            dp[n][i][bit | (1<<i)] %= MOD
+    
+res = 0
+for i in range(10):
+    res += dp[N][i][2**10-1]
+ 
+print(int(res%MOD))

Hongjoo/백준/버섯농장.py

@@ -0,0 +1,55 @@
+import math
+import sys
+from collections import deque
+
+def bfs(y_1 , x_1 , visited) :
+  # 초기 위치 방문
+  queue = deque()
+  queue.append((y_1,x_1))
+  visited[y_1][x_1] = True
+  count = 0  # 방문할 node 개수 
+  # 큐 시작
+  while queue :
+    y,x  =queue.popleft()
+    count+=1 
+    for k in range(4):
+      next_y, next_x = y + dy[k] , x + dx[k]
+      # 필드 범위 포함 확인 & 방문 확인 &이동 가능 지역(0)
+      if 0<=next_y<N and 0<=next_x<N :
+        if not visited[next_y][next_x] and not field[next_y][next_x] :
+          queue.append((next_y, next_x))
+          visited[next_y][next_x] = True
+  return count
+
+
+input =sys.stdin.readline
+N , M , K = map(int, input().split()) # field 범위, 씨앗 개수, 확산량
+X = M
+# 1. field 와 방문 등록 받기
+field = [[0 for _ in range(N)] for k in range(N)]
+visited = [[False for _ in range(N)] for k in range(N)]
+for i in range(N) :
+  field[i]=list(map(int, input().split()))
+# 상하좌우
+dy = [-1,1,0,0]
+dx = [0,0, -1,1]
+
+#2. bfs
+
+for i in range(N):
+  for j in range(N):
+    #포자 가능 지역 + 방문 안 한곳
+    if field[i][j] == 0 and not visited[i][j]:
+      cur_node = bfs( i, j , visited)
+      # 사용할 씨앗 청구하기
+      X = X - math.ceil(cur_node/K)
+      if X < 0 : #씨앗이 음수 남았으면 -> 불가능
+        print("IMPOSSIBLE")
+        exit()
+# 3. 마무리 출력
+if X == M : # 필드 자체가 농사 불가 -> 1개도 사용 못함
+  print("IMPOSSIBLE")
+  exit()
+elif X >= 0 : # 씨앗 남음
+  print("POSSIBLE")
+  print(X)

Hongjoo/백준/적록색약.py

@@ -0,0 +1,108 @@
+"""
+https://www.acmicpc.net/problem/10026
+
+
+- NXN (<= 1000) , R,G,B  
+- 상하좌우로 겹쳐진 "구역" = 1개 
+- 적록 색약 R = G , B
+
+
+=(1) 정상 
+R + G + B 
+(2) 색약
+max(R,G) + B
+# 유형 : DFS 
+
+# flow 
+
+
+1.(0,0) 부터 DFS 수행 + 방문(visited) 등록 : 1 X N*N
+2. 방문 리스트 : iT False not in visited , 까지 반복
+"""
+
+
+import sys
+# 1. 입력 받기 
+n = int(input())
+field = [ [] for _ in range(n) ]
+colors_g = [[] , [] , []]
+for i in range(n):
+    tmp = sys.stdin.readline().split()
+    # print(f"tmp {tmp}")
+    for t in range(len(tmp[0])) : 
+        field[i].append(tmp[0][t])
+        if tmp[0][t] == "R" : 
+            colors_g[0].append([i,t])
+        elif  tmp[0][t] == "G":
+            colors_g[1].append([i,t])
+        else :
+            colors_g[2].append([i,t])
+# print(f"colors-G {colors_g}")
+
+# 2. DFS 
+dx = [0,0,-1,1]
+dy = [-1,1,0,0,]
+def dfs(start_y,start_x, visited, flag , colors ):
+    r , g, b= colors
+    if field[start_y][start_x] == "R":
+        r+=1
+    elif field[start_y][start_x] == "G":
+        g+=1 
+    else : 
+        b+=1
+    queue = list()
+    queue.append([start_y,start_x])
+    visited.append([start_y,start_x])
+    while queue :
+        cur_y , cur_x= queue.pop()
+        for i in range(4):
+            next_y ,next_x = cur_y + dy[i] , cur_x + dx[i]
+            if next_y>= n or next_y < 0 or next_x>= n or next_x < 0:
+                print("####")
+                continue 
+            
+            if flag : #적록색약 경우
+                if field[cur_y][cur_x] in ["R","G"] and  field[next_y][next_x] in ["R","G"] and [next_y,next_x] not in visited :
+                    queue.append([next_y,next_x])
+                    visited.append([next_y,next_x]) 
+                    continue
+            if field[cur_y][cur_x] == field[next_y][next_x] and [next_y,next_x] not in visited : #색상이 같은 경우만 진행 
+                queue.append([next_y, next_x])
+                visited.append([next_y, next_x]) 
+                print(f"visited : {visited}")
+    return [r,g,b] ,visited
+
+
+# 1. 정상
+# visited= [ [False for _ in  range(n)] for k in range(n)]
+
+colors = [ 0, 0, 0]
+for c in range(3) :
+    category_colors = colors_g[c]
+    visited = []
+    while len(visited) <= len(category_colors): # R 
+        for y,x in category_colors : 
+            if [y,x] not in visited  :
+                colors , visited = dfs(y, x, visited , False , colors)
+                print(f"i {colors}")
+
+print(sum(colors))
+# visited = []
+# colors = [ 0, 0, 0]
+# for c in range(3) :
+#     category_colors = colors_g[c]
+#     while len(visited) <= len(category_colors ): # R 
+#         for y,x in category_colors : 
+#             if [y,x] not in visited  :
+#                 colors , visited = dfs(y, x, visited , True,colors)
+# print(sum(colors))
+    
+    
+                
+       
+
+
+
+
+
+