+ kjhonggg95 +
+ dydwo0740 +
+ qsunki +
+ ddingmin +
+ kwYoohae +
+ Baekjoon +
+ solved.ac +
+ Baekjoon +
+ solved.ac +
+ Baekjoon +
+ solved.ac +
+ Baekjoon +
+ solved.ac +
+ Baekjoon +
+ solved.ac +
|
+ + kjhonggg95 + |
+
+ + dydwo0740 + |
+
+ + qsunki + |
+
+ + ddingmin + |
+
+ + kwYoohae + |
||||
| kjhonggg95 | -dydwo0740 | -ajsthfldu | -ddingmin | -|||||
|
+ + Baekjoon + + solved.ac + |
+
+ + Baekjoon + + solved.ac + |
+
+ + Baekjoon + + solved.ac + |
+
+ + Baekjoon + + solved.ac + |
+
+ + Baekjoon + + solved.ac + |
+
|ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 10710번: 실크로드 | 
|ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 11607번: Grid | 
|ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 12764번: 싸지방에 간 준하 | 
|ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 12834번: 주간 미팅 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 12886번: 돌 그룹 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 12908번: 텔레포트 3 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 14497번: 주난의 난(難) | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 14618번: 총깡 총깡 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 14658번: 하늘에서 별똥별이 빗발친다 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 14718번: 용감한 용사 진수 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 14722번: 우유 도시 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 14925번: 목장 건설하기 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 15809번: 전국시대 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 16197번: 두 동전 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 16569번: 화산쇄설류 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 17299번: 오등큰수 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 17305번: 사탕 배달 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 18188번: 다오의 데이트 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 18430번: 무기 공학 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 19538번: 루머 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 19845번: 넴모넴모 2020 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 20440번: 🎵니가 싫어 싫어 너무 싫어 싫어 오지 마 내게 찝쩍대지마🎵 - 1 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 20924번: 트리의 기둥과 가지 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 2140번: 지뢰찾기 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 23740번: 버스 노선 개편하기 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 25319번: Twitch Plays VIIIbit Explorer | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 25391번: 특별상 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 25710번: 점수 계산 | 
|ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 2655번: 가장높은탑쌓기 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 27942번: :danceplant: | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 28017번: 게임을 클리어하자 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 28291번: 레드스톤 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 28325번: 호숫가의 개미굴 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 30023번: 전구 상태 바꾸기 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 30108번: 교육적인 트리 문제 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 3221번: 개미의 이동 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 4650번: Jungle Roads | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 4920번: 테트리스 게임 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 5502번: 팰린드롬 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 5546번: 파스타 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 6086번: 최대 유량 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 7983번: 내일 할거야 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 9077번: 지뢰제거 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 9489번: 사촌 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 9694번: 무엇을 아느냐가 아니라 누구를 아느냐가 문제다 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 9944번: NxM 보드 완주하기 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 14597번: Quilting (Large) | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 14945번: 불장난 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 15924번: 욱제는 사과팬이야!! | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 16167번: A Great Way | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 2171번: 직사각형의 개수 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 28270번: Marked-Numbered | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 4095번: 최대 정사각형 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 5547번: 일루미네이션 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 14369번: 전화번호 수수께끼 (Small) | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 1464번: 뒤집기 3 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 15551번: if 3 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 16765번: Teamwork | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 16932번: 모양 만들기 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 17953번: 디저트 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 18231번: 파괴된 도시 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 20033번: Square, Not Rectangle | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 2226번: 이진수 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 2370번: 시장 선거 포스터 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 24463번: 미로 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 24727번: 인지융~ | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 2513번: 통학버스 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 25682번: 체스판 다시 칠하기 2 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 2746번: 좋은 배열 만들기 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 27924번: 윤이는 엄청난 것을 훔쳐갔습니다 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 28359번: 수열의 가치 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 29618번: 미술 시간 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 31063번: Candy Cane Feast | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 10993번: 별 찍기 - 18 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 1132번: 합 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 14395번: 4연산 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 15482번: 한글 LCS | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 16169번: 수행 시간 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 16437번: 양 구출 작전 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 17208번: 카우버거 알바생 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 19639번: 배틀로얄 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 20209번: 스트레이트 스위치 게임 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 21941번: 문자열 제거 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 2313번: 보석 구매하기 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 23742번: Player-based Team Distribution | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 23883번: 알고리즘 수업 - 선택 정렬 3 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 30105번: 아즈버의 이빨 자국 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 30805번: 사전 순 최대 공통 부분 수열 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 3089번: 네잎 클로버를 찾아서 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 3107번: IPv6 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 3806번: S를 T로 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 5931번: Cow Beauty Pageant | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 9011번: 순서 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
+| 9082번: 지뢰찾기 | |ddingmin kjhonggg95 qsunki dydwo0740 kwyoohae |
diff --git a/ddingmin/baekjoon/10429.py b/ddingmin/baekjoon/10429.py
new file mode 100644
index 0000000..49869b4
--- /dev/null
+++ b/ddingmin/baekjoon/10429.py
@@ -0,0 +1,61 @@
+import sys
+
+
+def is_numeric(s):
+ try:
+ value = int(s)
+ return True
+ except ValueError:
+ return False
+
+
+def solve(n, m, arr):
+ dx, dy = [-1, 1, 0, 0], [0, 0, -1, 1]
+ visit = [[0] * 3 for _ in range(3)]
+ answer_cmd = None
+
+ def backtracking(i, j, cmd, total, target, depth):
+ nonlocal answer_cmd
+ if depth == 0:
+ if total == target:
+ answer_cmd = str(cmd)
+ return
+
+ for k in range(4):
+ x, y = i + dx[k], j + dy[k]
+ if not (0 <= x < 3 and 0 <= y < 3) or visit[x][y] == 1:
+ continue
+ visit[x][y] = 1
+ if is_numeric(arr[x][y]):
+ if arr[i][j] == '+':
+ backtracking(x, y, cmd + f"\n{x} {y}", total + int(arr[x][y]), target, depth - 1)
+ else:
+ backtracking(x, y, cmd + f"\n{x} {y}", total - int(arr[x][y]), target, depth - 1)
+ else:
+ backtracking(x, y, cmd + f"\n{x} {y}", total, target, depth)
+ visit[x][y] = 0
+
+ sx, sy = [0, 0, 1, 2, 2], [0, 2, 1, 0, 2]
+ for s in range(5):
+ xx, yy = sx[s], sy[s]
+ visit[xx][yy] = 1
+ backtracking(xx, yy, f"{xx} {yy}", int(arr[xx][yy]), n, m - 1)
+ visit[xx][yy] = 0
+ return answer_cmd
+
+
+def main():
+ n, m = map(int, input().split())
+ arr = [list(map(str, input().strip())) for _ in range(3)]
+ ans = solve(n, m, arr)
+ if ans is not None:
+ print(1)
+ print(ans, end = "")
+ else:
+ print(0)
+
+
+if __name__ == '__main__':
+ sys.setrecursionlimit(10 ** 5)
+ input = sys.stdin.readline
+ main()
diff --git a/ddingmin/baekjoon/10710.py b/ddingmin/baekjoon/10710.py
new file mode 100644
index 0000000..5b056a3
--- /dev/null
+++ b/ddingmin/baekjoon/10710.py
@@ -0,0 +1,24 @@
+import sys
+
+
+def solve(n, m, city, arr):
+ dp = [[float('inf')] * (n + 1) for _ in range(m + 1)]
+ dp[0][0] = 0
+
+ for i in range(1, m + 1): # 일
+ for j in range(n + 1): # 도시
+ dp[i][j] = min(dp[i - 1][j], dp[i - 1][j - 1] + city[j - 1] * arr[i - 1])
+
+ return dp[-1][-1]
+
+
+def main():
+ n, m = map(int, input().split())
+ city = list(int(input()) for _ in range(n))
+ arr = list(int(input()) for _ in range(m))
+ print(solve(n, m, city, arr))
+
+
+if __name__ == '__main__':
+ input = sys.stdin.readline
+ main()
diff --git a/ddingmin/baekjoon/11607.py b/ddingmin/baekjoon/11607.py
new file mode 100644
index 0000000..ec70706
--- /dev/null
+++ b/ddingmin/baekjoon/11607.py
@@ -0,0 +1,36 @@
+import sys
+from collections import deque
+
+input = sys.stdin.readline
+
+dx, dy = [1, -1, 0, 0], [0, 0, 1, -1]
+
+# input
+n, m = map(int, input().split())
+arr = [list(map(int, list(input().strip()))) for _ in range(n)]
+
+visit = [[0] * m for _ in range(n)]
+
+# init
+q = deque()
+q.append([0, 0])
+visit[0][0] = 1
+
+# bfs
+while q:
+ i, j = q.popleft()
+ for k in range(4):
+ x, y = i + dx[k] * arr[i][j], j + dy[k] * arr[i][j]
+ if not(0 <= x < n and 0 <= y < m):
+ continue
+ if visit[x][y] == 0:
+ q.append([x, y])
+ visit[x][y] = visit[i][j] + 1
+ elif visit[x][y] > visit[i][j] + 1:
+ q.append([x, y])
+ visit[x][y] = visit[i][j] + 1
+# answer check
+if visit[-1][-1] == 0:
+ print("IMPOSSIBLE")
+else:
+ print(visit[-1][-1] - 1)
diff --git a/ddingmin/baekjoon/12764.py b/ddingmin/baekjoon/12764.py
new file mode 100644
index 0000000..3aa651b
--- /dev/null
+++ b/ddingmin/baekjoon/12764.py
@@ -0,0 +1,38 @@
+import sys
+import heapq
+
+
+def solve(n, arr):
+ ans = []
+ hq = []
+ empty = []
+
+ for start, end in arr:
+ # 이용자 정리
+ while hq and hq[0][0] <= start:
+ t, seat = heapq.heappop(hq)
+ heapq.heappush(empty, seat)
+
+ # 남아있는 자리가 없는 경우
+ if len(empty) == 0:
+ ans.append(1)
+ heapq.heappush(hq, [end, len(ans) - 1])
+ else:
+ seat = heapq.heappop(empty)
+ heapq.heappush(hq, [end, seat])
+ ans[seat] += 1
+
+ return ans
+
+
+def main():
+ n = int(input())
+ arr = [list(map(int, input().split())) for _ in range(n)]
+ ans = solve(n, sorted(arr))
+ print(len(ans))
+ print(*ans)
+
+
+if __name__ == '__main__':
+ input = sys.stdin.readline
+ main()
diff --git a/ddingmin/baekjoon/12834.py b/ddingmin/baekjoon/12834.py
new file mode 100644
index 0000000..6fccd8c
--- /dev/null
+++ b/ddingmin/baekjoon/12834.py
@@ -0,0 +1,45 @@
+import sys
+import heapq
+
+
+def solve(n, v, e, KIST, CRFOOD, house, adj):
+ return dijk(KIST, adj, v, house) + dijk(CRFOOD, adj, v, house)
+
+
+def dijk(start, adj, v, house):
+ visit = [float('inf')] * (v + 1)
+ visit[start] = 0
+ hq = [[0, start]]
+ while hq:
+ cur_cost, cur_node = heapq.heappop(hq)
+ if cur_cost != visit[cur_node]: continue
+ for next_node, next_cost in adj[cur_node]:
+ value = cur_cost + next_cost
+ if value < visit[next_node]:
+ visit[next_node] = value
+ heapq.heappush(hq, [value, next_node])
+ distance = 0
+ for i in house:
+ distance += visit[i] if visit[i] != float('inf') else -1
+
+ return distance
+
+
+def main():
+ n, v, e = map(int, input().split())
+ KIST, CRFOOD = map(int, input().split())
+ house = list(map(int, input().split()))
+
+ adj = [[] for _ in range(v + 1)]
+ for _ in range(e):
+ a, b, c = map(int, input().split())
+ adj[a].append([b, c])
+ adj[b].append([a, c])
+
+ print(solve(n, v, e, KIST, CRFOOD, house, adj))
+
+
+if __name__ == '__main__':
+ # sys.setrecursionlimit(10 ** 6)
+ input = sys.stdin.readline
+ main()
diff --git a/ddingmin/baekjoon/12886.py b/ddingmin/baekjoon/12886.py
new file mode 100644
index 0000000..001a69b
--- /dev/null
+++ b/ddingmin/baekjoon/12886.py
@@ -0,0 +1,48 @@
+import sys
+from collections import deque
+
+
+def calc(x, y):
+ if x < y:
+ return x + x, y - x
+ else:
+ return x - y, y + y
+
+
+def get_abc(i, j, k):
+ result = []
+ a, b = calc(i, j)
+ result.append([a, b, k])
+ b, c = calc(j, k)
+ result.append([i, b, c])
+ a, c = calc(i, k)
+ result.append([a, j, c])
+ return result
+
+
+def solve(a, b, c):
+ visit = {}
+ visit[a, b, c] = True
+ q = deque()
+ q.append([a, b, c])
+
+ while q:
+ i, j, k = q.popleft()
+ if i == j == k:
+ return 1
+ for a, b, c in get_abc(i, j, k):
+ if (a, b, c) in visit: continue
+ q.append([a, b, c])
+ visit[a, b, c] = True
+ return 0
+
+
+def main():
+ a, b, c = map(int, input().split())
+ print(solve(a, b, c))
+
+
+if __name__ == '__main__':
+ sys.setrecursionlimit(10 ** 5)
+ input = sys.stdin.readline
+ main()
diff --git a/ddingmin/baekjoon/12908.py b/ddingmin/baekjoon/12908.py
new file mode 100644
index 0000000..db5c990
--- /dev/null
+++ b/ddingmin/baekjoon/12908.py
@@ -0,0 +1,76 @@
+import sys
+import heapq
+
+
+def get_node(nodes, cur):
+ if cur not in nodes:
+ nodes[cur] = len(nodes) + 1
+ return nodes[cur]
+
+
+def calc_distance(si, sj, ei, ej):
+ return abs(si - ei) + abs(sj - ej)
+
+
+def solve(adj, start, end):
+ # 다익스트라 돌려서 구하기
+ costs = [float('inf')] * 10
+ costs[start] = 0
+
+ hq = []
+ heapq.heappush(hq, [0, start])
+
+ while hq:
+ cur_cost, cur_node = heapq.heappop(hq)
+ # print(f"costs[cur_node]: {costs[cur_node]}, cur_cost: {cur_cost}, cur_node: {cur_node}")
+ if costs[cur_node] != cur_cost: continue
+ for next_node, next_cost in adj[cur_node]:
+ if cur_cost + next_cost < costs[next_node]:
+ costs[next_node] = cur_cost + next_cost
+ heapq.heappush(hq, [costs[next_node], next_node])
+
+ return costs[end]
+
+
+def main():
+ sx, sy = map(int, input().split())
+ ex, ey = map(int, input().split())
+ teleports = [list(map(int, input().split())) for _ in range(3)]
+ nodes = {}
+ adj = [[] * 10 for _ in range(10)]
+ start, end = get_node(nodes, str([sx, sy])), get_node(nodes, str([ex, ey]))
+ for i in range(3):
+ tsx, tsy, tex, tey = teleports[i]
+
+ # tp 이동시간, 직접 이동 시간 중 더 짧은 시간
+ t_node_start, t_node_end = get_node(nodes, str([tsx, tsy])), get_node(nodes, str([tex, tey]))
+ adj[t_node_start].append([t_node_end, min(10, calc_distance(tsx, tsy, tex, tey))])
+ adj[t_node_end].append([t_node_start, min(10, calc_distance(tsx, tsy, tex, tey))])
+
+ # 시작점 -> tps, tpe
+ adj[start].append([t_node_start, calc_distance(sx, sy, tsx, tsy)])
+ adj[start].append([t_node_end, calc_distance(sx, sy, tex, tey)])
+
+ # tps -> 도착점
+ adj[t_node_end].append([end, calc_distance(tex, tey, ex, ey)])
+ adj[t_node_start].append([end, calc_distance(tsx, tsy, ex, ey)])
+
+ for j in range(3):
+ if i == j: continue
+ ttsx, ttsy, ttex, ttey = teleports[j]
+ tt_node_start, tt_node_end = get_node(nodes, str([ttsx, ttsy])), get_node(nodes, str([ttex, ttey]))
+
+ adj[t_node_end].append([tt_node_start, calc_distance(tex, tey, ttsx, ttsy)])
+ adj[t_node_end].append([tt_node_end, calc_distance(tex, tey, ttex, ttey)])
+ adj[t_node_start].append([tt_node_start, calc_distance(tsx, tsy, ttsx, ttsy)])
+ adj[t_node_start].append([tt_node_end, calc_distance(tsx, tsy, ttex, ttey)])
+
+ # 바로 가는 거리랑 비교
+ distance = min(calc_distance(sx, sy, ex, ey), solve(adj, start, end))
+ print(distance)
+
+
+if __name__ == '__main__':
+ # sys.setrecursionlimit(10 ** 6)
+ input = sys.stdin.readline
+ main()
diff --git a/ddingmin/baekjoon/14497.py b/ddingmin/baekjoon/14497.py
new file mode 100644
index 0000000..024e8f7
--- /dev/null
+++ b/ddingmin/baekjoon/14497.py
@@ -0,0 +1,56 @@
+import sys
+from collections import deque
+
+input = sys.stdin.readline
+
+dx, dy = [1, -1, 0, 0], [0, 0, 1, -1]
+
+# input
+n, m = map(int, input().split())
+r, c, rr, cc = map(int, input().split())
+r, c, rr, cc = r - 1, c - 1, rr - 1, cc - 1
+
+arr = [list(input().strip()) for _ in range(n)]
+
+visited = [[0] * m for _ in range(n)]
+
+
+def jump():
+ q = deque()
+ visit = [[0] * m for _ in range(n)]
+ visit[r][c] = 1
+ q.append([r, c])
+
+ delete = []
+
+ while q:
+ i, j = q.popleft()
+ for k in range(4):
+ x, y = i + dx[k], j + dy[k]
+ if not (0 <= x < n and 0 <= y < m): continue
+ if visit[x][y]: continue
+
+ if visited[x][y] == 1:
+ visit[x][y] = 1
+ q.append([x, y])
+ elif visited[x][y] == 0 and arr[x][y] == '0':
+ visited[x][y] = 1
+ visit[x][y] = 1
+ q.append([x, y])
+ elif visited[x][y] == 0 and arr[x][y] != '0':
+ delete.append([x, y])
+
+ for x, y in delete:
+ visited[x][y] = 1
+ arr[x][y] = '0'
+
+
+ans = 0
+arr[r][c] = '0'
+visited[r][c] = 1
+
+while arr[rr][cc] == '#':
+ ans += 1
+ jump()
+
+print(ans)
diff --git a/ddingmin/baekjoon/14618.py b/ddingmin/baekjoon/14618.py
new file mode 100644
index 0000000..0ed6394
--- /dev/null
+++ b/ddingmin/baekjoon/14618.py
@@ -0,0 +1,54 @@
+import sys
+import heapq
+
+
+def solve(adj, visit, a_type, b_type, start):
+ # dijk
+ visit[start] = 0
+ hq = [[0, start]]
+ while hq:
+ dist, cur = heapq.heappop(hq)
+ if visit[cur] != dist:
+ continue
+ for next_dist, nxt in adj[cur]:
+ total_dist = dist + next_dist
+ if total_dist < visit[nxt]:
+ visit[nxt] = total_dist
+ heapq.heappush(hq, [total_dist, nxt])
+
+ # A형 집 부터 갱신
+ answer = [None, float('inf')]
+ for node in a_type:
+ if visit[node] < answer[1]:
+ answer = ['A', visit[node]]
+ for node in b_type:
+ if visit[node] < answer[1]:
+ answer = ['B', visit[node]]
+ if answer[0] is None:
+ return [-1]
+ return answer
+
+
+def main():
+ input = sys.stdin.readline
+ n, m = map(int, input().split()) # node, edge
+ adj = [[] for _ in range(n + 1)]
+ visit = [float('inf')] * (n + 1)
+
+ home_node = int(input())
+ k = int(input()) # 종류 별 동물의 수
+ a_type = list(map(int, input().split()))
+ b_type = list(map(int, input().split()))
+
+ for _ in range(m):
+ a, b, dist = map(int, input().split())
+ adj[a].append([dist, b])
+ adj[b].append([dist, a])
+
+ ans = solve(adj, visit, a_type, b_type, home_node)
+ for pp in ans:
+ print(pp)
+
+
+if __name__ == '__main__':
+ main()
diff --git a/ddingmin/baekjoon/14658.kt b/ddingmin/baekjoon/14658.kt
new file mode 100644
index 0000000..d39525f
--- /dev/null
+++ b/ddingmin/baekjoon/14658.kt
@@ -0,0 +1,40 @@
+import java.io.BufferedWriter
+import java.io.OutputStreamWriter
+
+fun main() = with(System.`in`.bufferedReader()) {
+ val sout = BufferedWriter(OutputStreamWriter(System.out))
+
+ var line = readLine().split(" ").map { it.toInt() }
+ var l = line[2]
+ var k = line[3]
+
+ var arr = Array(k) {
+ readLine().split(" ").map { it.toInt() }
+ }
+
+ sout.appendLine(solve(l, k, arr))
+ sout.close()
+}
+
+fun solve(l: Int, k: Int, arr: Array