[이지민] - 겹치는 건 싫어, 기타리스트, 회전초밥, 쉬운 최단거리

src/main/kotlin/jimin/43week/겹치는 건 싫어.py

@@ -0,0 +1,24 @@
+'''
+문제를 잘 못 이해했다.
+https://khu98.tistory.com/187 보고 깨달았다.
+'''
+
+n, k = map(int, input().split())
+nums = list(map(int, input().split()))
+nums_info = [0 for _ in range(max(nums) + 1)]
+start = 0
+end = 0
+maxi = 0
+
+while start < n and end < n:
+    if nums_info[nums[start]] < k:
+        nums_info[nums[start]] += 1
+        start += 1
+    elif nums_info[nums[start]] == k:
+        nums_info[nums[end]] -= 1
+        maxi = max(maxi, start - end)
+        end += 1
+
+
+maxi = max(maxi, n - end)
+print(maxi)

src/main/kotlin/jimin/43week/기타리스트.py

@@ -0,0 +1,27 @@
+'''
+재귀로 했더니 시간초과가 났다.
+재귀의 경우 2^(n + 1) - 2의 시간이 걸린다.
+하지만 dp 테이블을 만들경우 n * m 으로 50,000만 걸린다!
+https://jshong1125.tistory.com/56
+'''
+
+
+n, s, m = map(int, input().split())
+v = list(map(int, input().split()))
+dp = [[0 for _ in range(m + 1)] for _ in range(n + 1)]
+dp[0][s] = 1
+for i in range(0, n):
+    for j in range(m + 1):
+        if dp[i][j] == 1:
+            plus = j + v[i]
+            minus = j - v[i]
+            if 0 <= plus <= m:
+                dp[i + 1][plus] = 1
+            if 0 <= minus <= m:
+                dp[i + 1][minus] = 1
+
+maxi = -1
+for i in range(m + 1):
+    if dp[-1][i] == 1:
+        maxi = i
+print(maxi)

src/main/kotlin/jimin/43week/쉬운 최단거리.py

@@ -0,0 +1,39 @@
+from collections import deque
+
+
+def bfs(x, y):
+    global n, m
+    dx = [1, -1, 0, 0]
+    dy = [0, 0, 1, -1]
+
+    queue = deque([])
+    result[x][y] = 0
+    queue.append([x, y])
+
+    while queue:
+        nx, ny = queue.popleft()
+        for i in range(4):
+            if 0 <= nx + dx[i] < n and 0 <= ny + dy[i] < m:
+                if ground[nx + dx[i]][ny + dy[i]] == 1 and result[nx + dx[i]][ny + dy[i]] == -1:
+                    result[nx + dx[i]][ny + dy[i]] = result[nx][ny] + 1
+                    queue.append([nx + dx[i], ny + dy[i]])
+
+
+n, m = map(int, input().split())
+ground = []
+result = [[-1 for _ in range(m)] for _ in range(n)]
+x = 0
+y = 0
+for i in range(n):
+    g = list(map(int, input().split()))
+    for j in range(m):
+        if g[j] == 0:
+            result[i][j] = 0
+        elif g[j] == 2:
+            x = i
+            y = j
+    ground.append(g)
+
+bfs(x, y)
+for i in range(n):
+    print(" ".join(map(str, result[i])))

src/main/kotlin/jimin/43week/회전초밥.py

@@ -0,0 +1,18 @@
+'''
+sushi[:3000] 까지만 더 해야 시간초과 안남!
+'''
+
+n, d, k, c = map(int, input().split())
+sushi = []
+for i in range(n):
+    sushi.append(int(input()))
+
+maxi = 0
+sushi += sushi[:3000]
+for i in range(n):
+    eaten_sushi = sushi[i : i + k]
+    eaten_sushi.append(c)
+    eaten_sushi_length = len(list(set(eaten_sushi)))
+    maxi = max(maxi, eaten_sushi_length)
+
+print(maxi)