Submission #1755067

---

Source Code Expand

import sys
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt, ceil, floor
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
INF = float("inf")
sys.setrecursionlimit(10**7)

# 4近傍（右, 下, 左, 上）
dy = [0, -1, 0, 1]
dx = [1, 0, -1, 0]


def inside(y: int, x: int, H: int, W: int) -> bool: return 0 <= y < H and 0 <= x < W


def main():
    A, B = map(int, input().split())
    N = 50
    dp = [[INF] * 50 for _ in range(50)]
    for i in range(50):
        dp[i][i] = 0
    for x in [-1, 1, -5, 5, -10, 10]:
        for i in range(50):
            if 0 <= i + x < 50:
                dp[i][i + x] = 1
                dp[i + x][i] = 1

    for m in range(N):
        for s in range(N):
            for e in range(N):
                if dp[s][m] != INF and dp[m][e] != INF:
                    dist = dp[s][m] + dp[m][e]
                    if dist < dp[s][e]:
                        dp[s][e] = dist

    print(dp[A][B])

if __name__ == '__main__':
    main()

Submission Info

Judge Result