Spin-Pop-Squeeze-Clap

input/code.cpp: In function 'void init(const string&, const string&)':
input/code.cpp:40:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     for(int i=0; i<a.size(); i++) s1[i] = (int)a[i] - (int)('0');
      |                  ~^~~~~~~~~
input/code.cpp:41:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     for(int i=0; i<b.size(); i++) s2[i] = (int)b[i] - (int)('0');
      |                  ~^~~~~~~~~

#include <bits/stdc++.h>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;

static int8_t s1[1001];
static int8_t s2[1001];
static int n, m;
static int costs[1001][1001];

inline int cost(int a, int b){
    return s1[a] != s2[b];
}

void makeCosts(){
    costs[0][0] = 0;
    for(int i=0; i<n; i++){
        costs[i][0] = i;
    }
    for(int j=0; j<m; j++){
        costs[0][j] = j;
    }

    for(int j=1; j<m; j++){
        for(int i=1; i<n; i++){
            if(i == 0 && j == 0)
                continue;
            costs[i][j] = min({
                costs[i-1][j] + 1,
                costs[i][j-1] + 1,
                costs[i-1][j-1] + cost(i,j),
            });
        }
    }
}

void init(const string& a, const string& b){
    for(int i=0; i<a.size(); i++) s1[i] = (int)a[i] - (int)('0');
    for(int i=0; i<b.size(); i++) s2[i] = (int)b[i] - (int)('0');

    makeCosts();
}

int main(){
    string a, b;
    cin >> a;
    cin >> b;

    if(b.size() > a.size())
        swap(a,b);

    n = a.size();
    m = b.size();

    vector<ull> distances;

    for(int c=0; c<10; c++){
        init(a, b);
        for(int i=0; i<n; i++) s1[i] = (s1[i] + i) % 10;
        for(int i=0; i<m; i++) s2[i] = (s2[i] + i) % 10;

        makeCosts();
        auto d = costs[n-1][m-1];
        distances.push_back(c + d);
    }

    cout << *min_element(distances.begin(), distances.end()) << endl;

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: ACCEPTED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: ACCEPTED

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: ACCEPTED

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: ACCEPTED

Test 25

Verdict: WRONG ANSWER

Test 26

Verdict: WRONG ANSWER

Test 27

Verdict: WRONG ANSWER

Test 28

Verdict: WRONG ANSWER

Test 29

Verdict: WRONG ANSWER

Test 30

Verdict: WRONG ANSWER

Test 31

Verdict: WRONG ANSWER

Test 32

Verdict: WRONG ANSWER

Test 33

Verdict: WRONG ANSWER

Test 34

Verdict: WRONG ANSWER

Test 35

Verdict: WRONG ANSWER