Submission #1607003

---

Source Code Expand

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = float("inf")


def a(x, y):
    if x <= y:
        return y - x
    return INF


def main():
    x, y = map(int, input().split())

    ans = INF
    ans = min(ans, a(x, y))
    ans = min(ans, 1 + a(-x, y))
    ans = min(ans, 1 + a(x, -y))
    ans = min(ans, 2 + a(-x, -y))

    print(ans)


if __name__ == '__main__':
    main()

Submission Info

Judge Result