백준 11049번 행렬 곱셈 순서 v2

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

Author: skysign

백준 11049번 행렬 곱셈 순서 v2/main.py

@@ -0,0 +1,29 @@
+import sys
+
+
+def solve():
+    input = sys.stdin.readline
+    N = int(input().strip())
+    mats = [list(map(int, input().strip().split())) for _ in range(N)]
+    dp = [[sys.maxsize for _ in range(N)] for _ in range(N)]
+
+    for i in range(N):
+        dp[i][i] = 0
+
+    for bgn in range(N - 1):
+        end = bgn + 1
+        dp[bgn][end] = mats[bgn][0] * mats[bgn][1] * mats[end][1]
+
+    for l in range(2, N):
+        for bgn in range(N - l):
+            end = bgn + l
+            for mid in range(bgn, end):
+                dp[bgn][end] = min(dp[bgn][end], \
+                                   dp[bgn][mid] + dp[mid + 1][end] \
+                                   + (mats[bgn][0] * mats[mid][1] * mats[end][1]))
+
+    print(dp[0][N - 1])
+
+
+if __name__ == '__main__':
+    solve()

백준 11049번 행렬 곱셈 순서 v2/test1.txt

@@ -0,0 +1,4 @@
+3
+5 3
+3 2
+2 6

백준 11049번 행렬 곱셈 순서 v2/test1_answer.txt

@@ -0,0 +1 @@
+90

백준 11049번 행렬 곱셈 순서 v2/test_main.py

@@ -0,0 +1,23 @@
+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')