🐜 Study: 양궁대회 (#97)

Author: ing-eoking

ing-eoking/양궁대회.py

@@ -0,0 +1,22 @@
+def solution(n, info):
+    best = [-1]
+    max_diff = 0
+    def dfs(i, left, shot):
+        nonlocal best, max_diff
+        if i == 11:
+            shot[10] += left
+            scores = [(10 - j) * (s > a) for j, (s, a) in enumerate(zip(shot, info))]
+            lion = sum(scores)
+            apeach = sum(10 - j for j in range(11) if info[j] and shot[j] <= info[j])
+            if (diff := lion - apeach) > 0:
+                if diff > max_diff or (diff == max_diff and shot[::-1] > best[::-1]):
+                    best, max_diff = shot[:], diff
+            shot[10] -= left
+            return
+        for x in (info[i] + 1, 0):
+            if x <= left:
+                shot[i] = x
+                dfs(i + 1, left - x, shot)
+                shot[i] = 0
+    dfs(0, n, [0] * 11)
+    return best