Counter

from collections import deque

def counter():
    x = int(input())
    if x == 0:
        print(0)
        return
    # BFS
    queue = deque([(0, 0)]) #(現在値, 移動回数)
    visited = {0}

    while queue:
        current, moves = queue.popleft()

        next_val = current + 11
        if next_val == x:
            print(moves + 1)
            return
        if next_val <= x and next_val not in visited:
            visited.add(next_val)
            queue.append((next_val, moves + 1))
        
        next_val = current - 2
        if next_val == x:
            print(moves + 1)
            return
        if next_val >= 0 and next_val not in visited:
            visited.add(next_val)
            queue.append((next_val, moves + 1))
    
    print(-1)

if __name__ == "__main__":
    counter()

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED