[이지민] - 구간 합 구하기 5, 작업, 도넛과 막대 그래프

src/main/kotlin/jimin/53week/구간 합 구하기 5.py

@@ -0,0 +1,22 @@
+import sys
+
+n, m = map(int, sys.stdin.readline().split())
+numbers = []
+sum_info = [[0 for _ in range(n + 1)]]
+
+for i in range(n):
+    numbers.append(list(map(int, sys.stdin.readline().split())))
+
+for i in range(1, n + 1):
+    sub_info = [0]
+    tmp = [0]
+    for j in range(1, n + 1):
+        tmp.append(tmp[-1] + numbers[i - 1][j - 1])
+        sub_info.append(sum_info[i - 1][j] + tmp[-1])
+
+    sum_info.append(sub_info)
+
+for i in range(m):
+    x1, y1, x2, y2 = map(int, sys.stdin.readline().split())
+
+    print(sum_info[x2][y2] - sum_info[x1 - 1][y2] - sum_info[x2][y1 - 1] + sum_info[x1 - 1][y1 - 1])

src/main/kotlin/jimin/53week/도넛과 막대 그래프.py

@@ -0,0 +1,84 @@
+import itertools
+from collections import deque
+
+
+def solution(edges):
+    edge_size = max(list(itertools.chain(*edges)))
+    edge_info = [[] for _ in range(edge_size + 1)]
+    edge_get = [0 for _ in range(edge_size + 1)]
+    for a, b in edges:
+        edge_info[a].append(b)
+        edge_get[b] += 1
+
+    candidates = [[i, len(edge_info[i])] for i in range(1, edge_size + 1)]
+    candidates.sort(key=lambda x: x[1], reverse=True)
+    visited = [False for _ in range(edge_size + 1)]
+    visited[0] = True
+    point = -1
+
+    result = [0, 0, 0, 0]
+
+    for candidate, _ in candidates:
+        if edge_get[candidate] == 0:
+            point = candidate
+            break
+
+    result[0] = point
+
+    for edge in edge_info[point]:
+        edge_get[edge] -= 1
+
+    for i in range(1, edge_size + 1):
+        if i == point or visited[i] == True:
+            continue
+
+        type = check_graph(i, edge_info, visited, point)
+        if type != 4:
+            result[type] += 1
+
+    return result
+
+
+def check_graph(first, edge_info, visited, point):
+    type = -1
+
+    queue = deque([])
+    visited[first] = True
+    if (len(edge_info[first]) == 2):
+        type = 3
+
+    for e in edge_info[first]:
+        if visited[e] == False:
+            queue.append(e)
+        else:
+            if e == first:
+                type = 1
+            else:
+                type = 4
+
+    while queue:
+        now = queue.popleft()
+        visited[now] = True
+
+        if (len(edge_info[now]) == 2):
+            type = 3
+
+        if type != 3 and now == first:
+            type = 1
+
+        for e in edge_info[now]:
+            if visited[e] == False:
+                queue.append(e)
+            else:
+                if type != 3:
+                    if e == first:
+                        type = 1
+                    else:
+                        type = 4
+
+    if type == -1:
+        type = 2
+
+    return type
+
+

src/main/kotlin/jimin/53week/작업.py

@@ -0,0 +1,28 @@
+import sys
+from collections import deque
+
+n, m = map(int, sys.stdin.readline().split())
+jobs = [[] for _ in range(n + 1)]
+
+for i in range(m):
+    a, b = map(int, sys.stdin.readline().split())
+    jobs[b].append(a)
+
+x = int(sys.stdin.readline())
+
+queue = deque(jobs[x])
+visited = [False for _ in range(n + 1)]
+visited[x] = True
+
+num = 0
+while queue:
+   nxt = queue.popleft()
+   if not visited[nxt]:
+       num += 1
+       visited[nxt] = True
+
+       for t in jobs[nxt]:
+           if not visited[t]:
+               queue.append(t)
+
+print(num)

src/main/kotlin/jimin/53week/키 순서.py

@@ -0,0 +1,36 @@
+import sys
+from collections import deque
+
+
+def check_students(first, students, visited):
+    queue = deque(students[first])
+    visited[first] = 1
+
+    while queue:
+        now = queue.popleft()
+        visited[now] = 1
+
+        for student in students[now]:
+            queue.append(student)
+
+
+n, m = map(int, sys.stdin.readline().split())
+students = [[] for _ in range(n + 1)]
+reverse_students = [[] for _ in range(n + 1)]
+result = 0
+
+for _ in range(m):
+    a, b = map(int, sys.stdin.readline().split())
+    students[a].append(b)
+    reverse_students[b].append(a)
+
+for i in range(1, n + 1):
+    visited = [0 for _ in range(n + 1)]
+    visited[0] = 1
+    check_students(i, students, visited)
+    check_students(i, reverse_students, visited)
+
+    if all(visited):
+        result += 1
+
+print(result)