Merge pull request #692 from gmlrude/main

[박희경] 105차 라이브 코테 제출

Author: github-actions[bot]

live10/test105/문제1/박희경.py

@@ -0,0 +1,32 @@
+import sys
+from collections import *
+
+input = sys.stdin.readline
+
+
+# 도시 개수, 도로 개수, 거리 정보, 출발 도시
+n, m, k, x = map(int, input().split())
+graph = [[] for _ in range(n + 1)]
+
+for _ in range(m):
+    a, b = map(int, input().split())
+    graph[a].append(b)
+
+visited = [0] * (n + 1)
+visited[x] = 1
+result = []
+q = deque(([(x, 0)]))
+while q:
+    x, cnt = q.popleft()
+    if cnt == k:
+        result.append(x)
+    for nei in graph[x]:
+        if not visited[nei]:
+            visited[nei] = 1
+            q.append((nei, cnt + 1))
+
+if not result:
+    print(-1)
+else:
+    for res in sorted(result):
+        print(res)

live10/test105/문제2/박희경.py

@@ -0,0 +1,40 @@
+import sys
+
+input = sys.stdin.readline
+
+alpha = [chr(i) for i in range(ord('a'),ord('z')+1)]
+arr = [[0] * 26 for _ in range(26)]
+
+
+n = int(input())
+for _ in range(n):
+    i, _, j = map(str, input().split())
+    arr[alpha.index(i)][alpha.index(j)] = 1
+
+for k in range(26):
+    for i in range(26):
+        for j in range(26):
+            if i == j: continue
+            if arr[i][k] == 1 and arr[k][j] == 1:
+                arr[i][j] = 1
+
+
+m = int(input())
+for _ in range(m):
+    i, _, j = map(str, input().split())
+    if arr[alpha.index(i)][alpha.index(j)] == 1:
+        print('T')
+    else:
+        print('F')
+
+
+"""
+3
+a is b
+b is c
+c is d
+3
+a is d
+a is c
+d is a
+"""

live10/test105/문제3/박희경.py

@@ -0,0 +1,14 @@
+def solution(order):
+    i = 0
+    stack = []
+    
+    for box in range(1, len(order) + 1):
+        if box == order[i]:
+            i += 1
+        else:
+            stack.append(box)
+        while stack and stack[-1] == order[i]:
+            stack.pop()
+            i += 1
+    
+    return i