题解 | 时津风的资源收集

from collections import deque

# Build distance matrix
dist = [float("inf")] * 301
dist[10] = 0
dist[300] = 1
q = deque()
q.append(10)
q.append(300)
deltas = [x*y for x in (-1, 1) for y in (1, 10, 100)]
while q:
    x = q.popleft()
    for delta in deltas:
        nextX = x + delta
        if 10 <= nextX <= 300:
            nextDis = dist[x] + 1
            if nextDis < dist[nextX]:
                dist[nextX] = nextDis
                q.append(nextX)

T = int(input())
for _ in range(T):
    targets = map(int, input().split())
    res = sum(map(lambda x: dist[x], targets))
    print(res)