Merge pull request #151 from YoonYn9915/main

YoonYn9915/ 3월 1주차/ 3문제

Author: YoonYn9915

YoonYn9915/Graph/2025-03-08-[백준]-#1976-여행가자.py

@@ -0,0 +1,29 @@
+import sys
+
+input = sys.stdin.readline
+n = int(input())
+m = int(input())
+network = []
+visited = [0 for _ in range(n)]
+for _ in range(n):
+    network.append(list(map(int, input().split())))
+lst = list(map(int, input().split()))
+
+
+def dfs(start):
+    visited[start] = 1
+    for index, j in enumerate(network[start]):
+        if j == 1 and visited[index] == 0:
+            visited[index] = 1
+            dfs(index)
+
+
+dfs(lst[0] - 1)
+if 0 not in visited:
+    print('YES')
+    exit()
+for i in lst:
+    if visited[i - 1] == 0:
+        print('NO')
+        exit()
+print('YES')

YoonYn9915/implementation/2025-03-08-[백준]-#1717-집합의 표현.py

@@ -0,0 +1,32 @@
+import sys
+
+sys.setrecursionlimit(1000000)
+input = sys.stdin.readline
+
+n, m = map(int, input().split())
+parent = [i for i in range(n + 1)]
+
+def find_parent(x):
+    if parent[x] != x:
+        parent[x] = find_parent(parent[x])
+    return parent[x]
+
+
+def union_parent(a, b):
+    a = find_parent(a)
+    b = find_parent(b)
+    if a < b:
+        parent[b] = a
+    else:
+        parent[a] = b
+
+
+for _ in range(m):
+    opr, a, b = map(int, input().split())
+    if opr == 0:
+        union_parent(a, b)
+    else:
+        if find_parent(a) == find_parent(b):
+            print("YES")
+        else:
+            print("NO")

YoonYn9915/implementation/2025-03-08-[백준]-#1966-프린터 큐.py

@@ -0,0 +1,20 @@
+t = int(input())
+
+for _ in range(t):
+    n, m = map(int, input().split())
+    data = list(map(int, input().split()))
+
+    result = 1
+    while data:
+        if data[0] < max(data):
+            data.append(data.pop(0))
+
+        else:
+            if m == 0: break
+
+            data.pop(0)
+            result += 1
+
+        m = m - 1 if m > 0 else len(data) - 1
+
+    print(result)