Spin-Pop-Squeeze-Clap

input/code.cpp: In function 'int main()':
input/code.cpp:93:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |         for (int i = 0; i < s.size(); i++) {
      |                         ~~^~~~~~~~~~
input/code.cpp:95:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |             if (i < b.size()) {
      |                 ~~^~~~~~~~~~
input/code.cpp:134:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |         for (int i = 0; i < s.size(); i++) {
      |                         ~~^~~~~~~~~~
input/code.cpp:141:22: warning: comparison of integer expressions of different signedne...

#include <bits/stdc++.h>
using namespace std;
#define int long long

string to_string(string s) {
    return '"' + s + '"';
}
 
string to_string(const char* s) {
    return to_string((string) s);
}
 
string to_string(bool b) {
    return (b ? "true" : "false");
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
    return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A>
string to_string(A v) {
    bool first = true;
    string res = "{";
    for (const auto &x : v) {
        if (!first) {
            res += ", ";
        }
        first = false;
        res += to_string(x);
    }
    res += "}";
    return res;
}
 
void debug_out() {
    cerr << endl;
}
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << to_string(H);
    debug_out(T...);
}
 
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

const int N = 1e5 + 5;

int n, m, mx;
string a, b;

unordered_map<string, int> mp;

signed main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> a >> b;
    n = a.size();
    m = b.size();
    mx = max(n, m);

    queue<string> q;
    mp[a] = 0;
    q.push(a);

    auto add = [&](string s, int cur) {
        if (s == a) return;
        auto it = mp.find(s);
        if (it == mp.end()) {
            mp[s] = cur + 1;
            q.push(s);
        }
    };

    while (q.size()) {
        string s = q.front();
        q.pop();

        if (s == b) break;

        string ori = s;
        int cur = mp[s];

        // debug(s, cur);

        // spin
        for (int i = 0; i < s.size(); i++) {
            char tmp = s[i];
            if (i < b.size()) {
                s[i] = b[i];
                add(s, cur);
                s[i] = tmp;
            }

            // int num = s[i] - '0';
            // for (int d = num - 1; d >= 0; d--) {
            //     // debug(d, num);
            //     s[i] = '0' + d;
            //     add(s, cur);
            //     s[i] = tmp;
            // }
            // for (int d = 9; d > num; d--) {
            //     // debug(d, num);
            //     s[i] = '0' + d;
            //     add(s, cur);
            //     s[i] = tmp;
            // }
            

            for (char d = '0'; d <= '9'; d++) {
                if (s[i] == d) continue;
                s[i] = d; 
                add(s, cur);
                s[i] = tmp;
            }
        }
        s = ori;

        // clap
        for (char& c : s) {
            int num = c - '0';
            c = '0' + (num + 1) % 10;
        }
        add(s, cur);
        s = ori;

        // pop
        for (int i = 0; i < s.size(); i++) {
            s.erase(s.begin() + i);
            add(s, cur);
            s = ori;
        }
        s = ori;

        if (s.size() < mx) {
            // squeeze
            for (char d = '0'; d <= '9'; d++) {
                s = d + s;
                add(s, cur);
                for (int i = 0; i < s.size(); i++) {
                    swap(s[i], s[i + 1]);
                    add(s, cur);
                }
                s = ori;
            } 
            s = ori;
        }
    }

    cout << mp[b] << '\b';
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: RUNTIME ERROR

Test 10

Verdict: RUNTIME ERROR

Test 11

Verdict: RUNTIME ERROR

Test 12

Verdict: RUNTIME ERROR

Test 13

Verdict: RUNTIME ERROR

Test 14

Verdict: RUNTIME ERROR

Test 15

Verdict: RUNTIME ERROR

Test 16

Verdict: RUNTIME ERROR

Test 17

Verdict: RUNTIME ERROR

Test 18

Verdict: RUNTIME ERROR

Test 19

Verdict: RUNTIME ERROR

Test 20

Verdict: RUNTIME ERROR

Test 21

Verdict: RUNTIME ERROR

Test 22

Verdict: RUNTIME ERROR

Test 23

Verdict: RUNTIME ERROR

Test 24

Verdict: RUNTIME ERROR

Test 25

Verdict: RUNTIME ERROR

Test 26

Verdict: RUNTIME ERROR

Test 27

Verdict: RUNTIME ERROR

Test 28

Verdict: RUNTIME ERROR

Test 29

Verdict: RUNTIME ERROR

Test 30

Verdict: RUNTIME ERROR

Test 31

Verdict: RUNTIME ERROR

Test 32

Verdict: RUNTIME ERROR

Test 33

Verdict: RUNTIME ERROR

Test 34

Verdict: RUNTIME ERROR

Test 35

Verdict: RUNTIME ERROR