[김진용] 63차 라이브 코테 제출 (#516)

* 61차 1번 문제풀이

* 61차 2번 문제풀이

* 61차 3번 문제풀이

* 61차 문제 3번 다시 풀기

* 62차 1번 문제풀이

* 62차 2번 문제풀이

* 문제 2 수정

* 62차 3번 문제풀이

* 63차 1번 문제풀이

* 63차 2번 문제풀이

* 63차 문제 3번 문제풀이

Author: kingjinyong

live6/test62/문제3/김진용.py

@@ -0,0 +1,28 @@
+def solution(n, words):
+    ary = []
+    people = 1
+    cnt = 1
+    ary.append(words[0])
+    for i in range(1, len(words)):
+        # print(cnt, people, words[i])
+        people += 1
+        if people % n == 0:
+            people = n
+        else:
+            people = people%n
+        if words[i][0] != words[i-1][-1] or words[i] in ary:
+            # print(words[i][0], words[i-1][-1])
+            return [people, cnt]
+        else:
+            ary.append(words[i])
+        if people == n:
+            cnt += 1
+    return [0, 0]
+
+
+
+print(solution(3, ["tank", "kick", "know", "wheel", "land", "dream", "mother", "robot", "tank"]))
+print(solution(5,
+               ["hello", "observe", "effect", "take", "either", "recognize", "encourage", "ensure", "establish", "hang",
+                "gather", "refer", "reference", "estimate", "executive"]))
+print(solution(2, ["hello", "one", "even", "never", "now", "world", "draw"]))

live6/test63/문제1/김진용.py

@@ -0,0 +1,14 @@
+n, k = map(int, input().split())
+ary = list(map(int, input().split()))
+start = 0
+end = k-1
+s_w = sum(ary[:k])
+result = []
+result.append(s_w)
+while end < len(ary)-1:
+    s_w -= ary[start]
+    start += 1
+    end += 1
+    s_w += ary[end]
+    result.append(s_w)
+print(max(result))

live6/test63/문제2/김진용.py

@@ -0,0 +1,14 @@
+import sys
+input = sys.stdin.readline
+n = int(input())
+ary = []
+ary_2 = []
+for i in range(n):
+    ary.append(i+1)
+    ary_2.append(int(input()))
+ary_2.sort()
+
+result = 0
+for i in range(n):
+    result += abs(ary[i] - ary_2[i])
+print(result)

live6/test63/문제3/김진용.py

@@ -0,0 +1,36 @@
+import math
+
+
+def solution(N, road, K):
+    result = 0
+
+    city = [[math.inf]*(N+1) for _ in range(N + 1)]
+
+    for r in road:
+        x, y, t = r[0], r[1], r[2]
+
+        if city[x][y] != math.inf:
+            city[x][y] = min(city[x][y], t)
+        if city[y][x] != math.inf:
+            city[y][x] = min(city[y][x], t)
+        else:
+            city[x][y] = t
+            city[y][x] = t
+    for k in range(1, N + 1):
+        for i in range(1, N + 1):
+            for j in range(1, N + 1):
+                if city[i][k] != math.inf and city[k][j] != math.inf:
+                    city[i][j] = min(city[i][j], city[i][k] + city[k][j])
+                if i == j:
+                    city[i][j] = 0
+
+    for c in city[1]:
+        if c <= K:
+            result += 1
+
+    return result
+
+
+
+print(solution(5, [[1, 2, 1], [2, 3, 3], [5, 2, 2], [1, 4, 2], [5, 3, 1], [5, 4, 2]], 3))
+print(solution(6, [[1, 2, 1], [1, 3, 2], [2, 3, 2], [3, 4, 3], [3, 5, 2], [3, 5, 3], [5, 6, 1]], 4))