백준 1005번 ACM Craft v2

문제 링크: https://www.acmicpc.net/problem/1005

Author: skysign

백준 1005번 ACM Craft v2/main.py

@@ -0,0 +1,41 @@
+import sys
+sys.setrecursionlimit(100000)
+
+
+def solve():
+    input = sys.stdin.readline
+    T = int(input().strip())
+
+    for _ in range(T):
+        N, K = map(int, input().strip().split())
+        dts = [0] + list(map(int, input().strip().split()))
+        dp = [-1 for _ in range(N + 1)]
+        incoming = [[] for _ in range(N + 1)]
+        for _ in range(K):
+            to, fr = map(int, input().strip().split())
+            incoming[fr].append(to)
+
+        target = int(input().strip())
+
+        dfs(dts, dp, incoming, target)
+
+        print(dp[target])
+
+
+def dfs(dts, dp, incoming, node):
+    answer_local = 0
+
+    if len(incoming[node]) > 0:
+        for fr in incoming[node]:
+            if dp[fr] == -1:
+                dfs(dts, dp, incoming, fr)
+
+            answer_local = max(answer_local, dp[fr])
+
+        dp[node] = answer_local + dts[node]
+    else:
+        dp[node] = dts[node]
+
+
+if __name__ == '__main__':
+    solve()

백준 1005번 ACM Craft v2/test1.txt

@@ -0,0 +1,19 @@
+2
+4 4
+10 1 100 10
+1 2
+1 3
+2 4
+3 4
+4
+8 8
+10 20 1 5 8 7 1 43
+1 2
+1 3
+2 4
+2 5
+3 6
+5 7
+6 7
+7 8
+7

백준 1005번 ACM Craft v2/test1_answer.txt

@@ -0,0 +1,2 @@
+120
+39

백준 1005번 ACM Craft v2/test2.txt

@@ -0,0 +1,42 @@
+5
+3 2
+1 2 3
+3 2
+2 1
+1
+4 3
+5 5 5 5
+1 2
+1 3
+2 3
+4
+5 10
+100000 99999 99997 99994 99990
+4 5
+3 5
+3 4
+2 5
+2 4
+2 3
+1 5
+1 4
+1 3
+1 2
+4
+4 3
+1 1 1 1
+1 2
+3 2
+1 4
+4
+7 8
+0 0 0 0 0 0 0
+1 2
+1 3
+2 4
+3 4
+4 5
+4 6
+5 7
+6 7
+7

백준 1005번 ACM Craft v2/test2_answer.txt

@@ -0,0 +1,5 @@
+6
+5
+399990
+2
+0

백준 1005번 ACM Craft v2/test_main.py

@@ -0,0 +1,26 @@
+import sys
+from pathlib import Path
+from unittest import TestCase
+from main import solve
+
+
+class Test(TestCase):
+    def my_solve(self, testcase_input):
+        sys.stdin = open(testcase_input, 'r')
+        stdout = sys.stdout
+        sys.stdout = open('stdout.txt', 'w')
+        solve()
+        sys.stdout.close()
+        sys.stdout = stdout
+
+    def test_solve(self, testcase_number: str):
+        self.my_solve('test' + testcase_number + '.txt')
+        self.assertEqual(
+            Path('test' + testcase_number + '_answer.txt').read_text().strip(),
+            Path('stdout.txt').read_text().strip())
+
+    def test1_solve(self):
+        self.test_solve('1')
+
+    def test2_solve(self):
+        self.test_solve('2')