Merge branch 'main' of https://github.com/zaqquum/Hongjoo_algorithm_study

Author: zaqquum

YoonYn9915/Graph/2024-11-04-[백준]-#14567-선수 과목.py

@@ -0,0 +1,46 @@
+from collections import deque
+
+def topology_sort(graph, inDegree):
+    queue = deque()
+
+    result = [-1] * (N+1)
+
+
+    # 진입차수가 0인 정점을 queue에 추가
+    for i in range(1, N+1):
+        if inDegree[i] == 0:
+            queue.append(i)
+            result[i] = 1
+
+
+    while queue:
+        now = queue.popleft()
+
+        for vertex in graph[now]:
+            inDegree[vertex] -= 1
+            if inDegree[vertex] == 0:
+                queue.append(vertex)
+                result[vertex] = result[now] + 1
+
+    return result
+
+
+
+# 입력값 받기
+N, M = map(int, input().split())
+
+# 과목 개수만큼 이차원 리스트 만들기
+graph = [ [] for _ in range(N+1)]
+
+# 진입차수 리스트
+inDegree = [0] * (N+1)
+result = [] * (N+1)
+
+for i in range(M):
+    A, B = map(int, input().split())
+    graph[A].append(B)
+    inDegree[B] += 1
+
+result = topology_sort(graph, inDegree)
+for i in range(1,N+1):
+    print(result[i], end=" ")

YoonYn9915/math/2024-11-04-[백준]-#1004-어린 왕자.py

@@ -0,0 +1,25 @@
+T = int(input())
+result = []
+
+for _ in range(T):
+    # 출발점 도착점
+    x1, y1, x2, y2 = list(map(int, input().split()))
+    # 행성계의 개수
+    n = int(input())
+    count = 0
+    for _ in range(n):
+        cx, cy, cr = map(int, input().split())
+        dis1 = (x1 - cx) ** 2 + (y1 - cy) ** 2
+        dis2 = (x2 - cx) ** 2 + (y2 - cy) ** 2
+        pow_cr = cr ** 2
+
+        if pow_cr > dis1 and pow_cr > dis2:
+            pass
+        elif pow_cr > dis1:
+            count += 1
+        elif pow_cr > dis2:
+            count += 1
+    result.append(count)
+
+for i in result:
+    print(i, end="\n")