Spin-Pop-Squeeze-Clap

input/code.cpp: In function 'int main()':
input/code.cpp:48:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         for (int j = 0; j < A.size(); ++j) {
      |                         ~~^~~~~~~~~~
input/code.cpp: In instantiation of 'uint64_t distance(auto:18, auto:19) [with auto:18 = std::vector<unsigned int>; auto:19 = std::vector<unsigned int>; uint64_t = long unsigned int]':
input/code.cpp:47:32:   required from here
input/code.cpp:13:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<unsigned int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for (int i = 0; i < A.size(); ++i) {
      |                     ~~^~~~~~~~~~
input/code.cpp:16:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<unsigned int>::size_type' {aka 'long unsigned int'} [-Wsig...

#include <iostream>
#include <vector>
#include <cstdint>
#include <numeric>

uint64_t add_one_if_unequal(auto &iter1, auto &iter2) {
    if (*iter1 == iter2) return 0;
    return 1;
}

uint64_t distance(auto A, auto B) {
    std::vector<std::vector<int>> distances(A.size()+1, std::vector<int>(B.size()+1));
    for (int i = 0; i < A.size(); ++i) {
        distances[i][0] = i;
    }
    for (int i = 0; i < B.size(); ++i) {
        distances[0][i] = i;
    }
    for (int a = 1; a <= A.size(); ++a) {
        for (int b = 1; b <= B.size(); ++b) {
            distances[a][b] = INT32_MAX;

            distances[a][b] = std::min(distances[a][b], distances[a][b-1]+1);
            distances[a][b] = std::min(distances[a][b], distances[a-1][b]+1);

            int cost = A[a-1] != B[b-1];
            distances[a][b] = std::min(distances[a][b], distances[a-1][b-1] + cost);
        }
    }
    return distances[A.size()][B.size()];
}

int main() {
    std::string A, B;
    std::cin >> A >> B;
    
    std::vector<uint> A_vec, B_vec;
    for (char a : A) {
        A_vec.push_back(a-'0');
    }
    for (char b : B) {
        B_vec.push_back(b-'0');
    }

    uint64_t min = UINT64_MAX;
    for (int i = 0; i < 10; ++i) {
        min = std::min(distance(A_vec, B_vec)+i, min);
        for (int j = 0; j < A.size(); ++j) {
            A_vec[j] = (A_vec[j] + 1) % 10;
        }
    }

    std::cout << min;
}

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: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: ACCEPTED

Test 24

Verdict: WRONG ANSWER

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: WRONG ANSWER

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: WRONG ANSWER

Test 32

Verdict: WRONG ANSWER

Test 33

Verdict: ACCEPTED

Test 34

Verdict: WRONG ANSWER

Test 35

Verdict: ACCEPTED