Submission #31588660


Source Code Expand

n, a, b, c = map(int, input().split())
l = [0] * n
for i in range(n):
    l[i] = int(input())
def solve(a2, b2, c2, l2):
    if len(l2) == 0:
        if a2 == 0 or b2 == 0 or c2 == 0:
            return 1000000000
        return abs(a - a2) + abs(b - b2) + abs(c - c2)
    return min(
        solve(a2, b2, c2, l2[1 :]),
        solve(a2 + l2[0], b2, c2, l2[1 :]) + 10,
        solve(a2, b2 + l2[0], c2, l2[1 :]) + 10,
        solve(a2, b2, c2 + l2[0], l2[1 :]) + 10,
    )
print(solve(0, 0, 0, l) - 30)

Submission Info

Submission Time
Task C - Synthetic Kadomatsu
User Pro_ktmr
Language PyPy3 (7.3.0)
Score 300
Code Size 518 Byte
Status AC
Exec Time 90 ms
Memory 73704 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 20
Set Name Test Cases
Sample a01, a02, a03
All a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20
Case Name Status Exec Time Memory
a01 AC 66 ms 61772 KiB
a02 AC 83 ms 73444 KiB
a03 AC 83 ms 72864 KiB
b04 AC 56 ms 60960 KiB
b05 AC 75 ms 72664 KiB
b06 AC 49 ms 61176 KiB
b07 AC 50 ms 61472 KiB
b08 AC 73 ms 72860 KiB
b09 AC 81 ms 73352 KiB
b10 AC 85 ms 73180 KiB
b11 AC 82 ms 72988 KiB
b12 AC 80 ms 72464 KiB
b13 AC 82 ms 73248 KiB
b14 AC 89 ms 73312 KiB
b15 AC 85 ms 73704 KiB
b16 AC 81 ms 72952 KiB
b17 AC 86 ms 73676 KiB
b18 AC 85 ms 73456 KiB
b19 AC 90 ms 72836 KiB
b20 AC 84 ms 73124 KiB