Merge branch 'main' of https://github.com/JavaJobJava/CodingTest

Author: bsyzch

cmkim/BaekJoon/백준_17179.py

@@ -0,0 +1,45 @@
+n, m, l = map(int, input().split())
+
+cut = []
+arr = []
+for i in range(m):  # 자르는 위치
+    cut.append(int(input()))
+#print(cut)
+
+for i in range(n):  # 자르는 횟수
+    arr.append(int(input()))
+
+def calculate(mid, count): # 가장 작은 조각의 길이 > mid 일때 횟수를 세서 count 값이 만들어지면 성공
+    prev = 0
+    for i in range(m):
+        if cut[i] - prev >= mid:
+            count -= 1
+            prev = cut[i]
+            if count == 0:
+                break
+
+
+    if count == 0 and l - prev >= mid:
+        return True
+    else:
+        return False
+
+for i in range(n):
+    piece = arr[i]
+    left = 0
+    right = l
+
+    while left + 1 < right:
+        mid = (left + right) // 2
+        if calculate(mid, piece):
+            left = mid
+        else:
+            right = mid
+
+    print(left)
+
+
+
+
+
+

cmkim/BaekJoon/백준_4386.py

@@ -0,0 +1,48 @@
+import sys, math, heapq
+n = int(input())
+
+arr = []
+connected = []
+sum = 0
+cost = 1e9
+
+def dist(x1, y1, x2, y2):
+    return math.sqrt((x1 - x2)**2 + (y1 - y2)**2)
+
+for i in range(n):
+    x, y = map(float, input().split())
+    arr.append((x, y))
+
+q = []
+connected.append(0)
+for i in range(1, n):
+    heapq.heappush(q, (dist(arr[0][0], arr[0][1], arr[i][0], arr[i][1]), i))
+
+# print(connected)
+# print(q)
+
+while n != len(connected):
+    value, node = heapq.heappop(q)
+    while node in connected:
+        value, node = heapq.heappop(q)
+
+    sum += value
+    connected.append(node)
+
+    for i in range(n):
+        if i not in connected:
+            heapq.heappush(q, (dist(arr[node][0], arr[node][1], arr[i][0], arr[i][1]), i))
+
+print("%.2f"%(sum))
+
+
+
+
+
+
+
+
+
+
+
+

cmkim/이것이 취업을 위한 코딩 테스트다/경쟁적 전염_344p.py

@@ -0,0 +1,59 @@
+from collections import deque
+import heapq
+
+n, k = map(int, input().split())
+arr = [[]]
+
+temp = []
+q = deque()
+heap = []
+def dfs(count):
+    while q:
+        virus, x, y = q.popleft()
+        for i in range(4):
+            nx, ny = x + dx[i], y + dy[i]
+            if 0 < nx <= n and 0 < ny <= n:
+                if arr[nx][ny] == 0:
+                    arr[nx][ny] = virus
+                    q.append((virus, nx, ny))
+        count -= 1
+
+        if count == 0:
+            return
+
+
+dx = [-1, 1, 0, 0] # 상하좌우
+dy = [0, 0, -1, 1]
+
+for i in range(1, n+1):
+    arr.append(list(map(int, input().split())))
+    arr[i].insert(0, 0)
+    for j in range(n+1):
+        if arr[i][j]:
+            temp.append((arr[i][j], i, j))# 바이러스 종류, 행, 열
+            #heapq.heappush(heap, (arr[i][j], (i, j)))
+            #q.append((arr[i][j], i, j))# 바이러스 종류, 행, 열
+
+
+count = 1
+while True: # 너무 무식하게 넣었는데 더 깔끔한 방법은 없을까?
+    for i in range(len(temp)):
+        if temp[i][0] == count:
+            q.append((temp[i][0], temp[i][1], temp[i][2]))
+    count += 1
+    if count > k:
+        break
+
+
+
+s, x, y = map(int, input().split())
+
+for i in range(s):
+    dfs(len(q))
+
+print(arr[x][y])
+
+
+
+
+

cmkim/이것이 취업을 위한 코딩 테스트다/특정 거리의 도시 찾기_339p.py

@@ -0,0 +1,40 @@
+from _collections import deque
+
+n, m, k, x = map(int, input().split())
+
+arr = [[] for _ in range(n+1)]
+dist = [1000000000] * (n+1)
+
+for i in range(m):
+    a, b = map(int, input().split())
+    arr[a].append(b)
+    #arr[b].append(a)
+
+q = deque()
+q.append((x, 1))
+
+while q:
+    start, cost = q.popleft()
+
+    for end in arr[start]:
+        dist[end] = min(dist[end], cost)
+        q.append((end, cost+1))
+
+count = 0
+for i in range(1, n+1):
+    if dist[i] == k:
+        print(i)
+        count += 1
+
+if not count:
+    print(-1)
+
+
+
+'''
+4 4 2 1
+1 2 
+1 3
+2 3
+2 4 
+'''

cmkim/이것이 취업을 위한 코딩 테스트다/특정거리의 도시찾기_339p.py

@@ -0,0 +1,63 @@
+#CH12 구현 기출
+#예제 12-11
+#뱀
+#백준 3190
+#골드 5
+
+# 먼저 뱀은 몸길이를 늘려 머리를 다음칸에 위치시킨다.
+# 만약 이동한 칸에 사과가 있다면, 그 칸에 있던 사과가 없어지고 꼬리는 움직이지 않는다.
+# 만약 이동한 칸에 사과가 없다면, 몸길이를 줄여서 꼬리가 위치한 칸을 비워준다. 즉, 몸길이는 변하지 않는다.
+
+from collections import deque
+
+#N:board size, K:apple count
+N = int(input())
+K = int(input())
+
+#0: 빈칸, 1:사과, 2:뱀 몸통
+maps = [[0]*(N+1) for _ in range(N+1)]
+#사과 입력 
+for i in range(K):
+    a,b = map(int,input().split())
+    maps[a][b]=1
+
+#방향전환 입력 
+opCnt = int(input())
+ops = deque([])
+for i in range(opCnt):
+    a,b = map(str,input().split())
+    ops.append((int(a),b))
+
+time = 0
+moves = [(0,1),(1,0),(0,-1),(-1,0)] #우하좌상
+direction = 0
+row , col = 1, 1
+snake = deque([(row,col)])
+maps[row][col]=2
+
+while True:
+    #시간 1초 증가
+    time += 1
+    #이동
+    row = row+moves[direction][0]
+    col = col+moves[direction][1]
+    if (row<=0 or row>N) or (col<=0 or col>N) or maps[row][col]==2:
+        gameover = True
+        break
+    else:
+        snake.append((row,col))
+        if maps[row][col]==0:
+            a,b = snake.popleft()
+            maps[a][b]=0
+        maps[row][col]=2
+    #명령 시간이 되었다면 
+    if ops and ops[0][0]==time:
+        X,C = ops.popleft()
+        if C=='L':
+            direction=direction-1 if direction>0 else 3
+        elif C=='D':
+            direction=direction+1 if direction<3 else 0
+
+
+print(time)
+

syheo/codingTest1/12-11-뱀.py

@@ -0,0 +1,62 @@
+#CH12 구현 기출
+#예제 12-13
+#치킨배달
+#백준 15686
+#골드 5
+
+from collections import deque
+
+def distance(a,b,c,d):
+    return abs(a-c)+abs(b-d)
+
+def bfs(a,chickenCnt,M):
+    rstList = []
+    q = deque([(a,1,[a])])
+    while q:
+        cur,cnt,chickenList = q.popleft()
+        if cnt == M:
+            rst = 0
+            for house in houses:
+                minDis = 101
+                for item in chickenList:
+                    minDis = min(distance(house[0],house[1],chickens[item][0],chickens[item][1]),minDis)
+                rst+=minDis
+            rstList.append(rst)
+
+        for i in range(1,chickenCnt):
+            pos = cur +i
+            if pos<chickenCnt:
+                q.append((pos,cnt+1,chickenList+[pos]))
+            else:
+                break
+    return min(rstList)
+
+N,M = map(int,input().split())
+
+maps = []
+
+for i in range(N):
+    maps.append(list(map(int,input().split())))
+
+chickens = []
+houses = []
+
+for i in range(N):
+    for j in range(N):
+        if maps[i][j]==2:
+            chickens.append((i,j))
+        if maps[i][j]==1:
+            houses.append((i,j))
+
+
+
+answer = int(1e9)
+
+for i in range(0,len(chickens)-M+1):
+    answer=min(bfs(i,len(chickens),M),answer)
+
+print(answer)
+
+
+
+

syheo/codingTest1/12-13-치킨배달.py

@@ -0,0 +1,41 @@
+#CH13 BFSDFS기출
+#예제 13-15
+#특정거리의 도시찾기
+#백준 18352
+#실버 2 
+
+from collections import deque
+import sys
+input = sys.stdin.readline
+
+N,M,K,X = map(int,input().split())
+
+edges = [[] for _ in range(N+1)]
+visited = [False for _ in range(N+1)]
+#간선 정보 입력 받기
+for i in range(M):
+    a,b = map(int,input().split())
+    edges[a].append(b)
+
+def bfs():
+    answer = []
+    q = deque([])
+    q.append((X,0)) #현재노드, 이동 거리 
+    visited[X]=True
+    while q:
+        node, cnt = q.popleft()
+        if cnt==K:
+            answer.append(node)
+        for next in edges[node]:
+            if not visited[next]:
+                q.append((next,cnt+1))
+                visited[next]=True
+    return answer 
+
+result = bfs()
+result.sort()
+if len(result)==0:
+    print(-1)
+else:
+    for res in result:
+        print(res)