Babaza Game

input/code.cpp: In function 'void solve()':
input/code.cpp:129:9: warning: unused variable 'cnt' [-Wunused-variable]
  129 |     int cnt = 0;
      |         ^~~

/*
    Road to Freedom
*/

#include <bits/stdc++.h>

using namespace std;

#define ll             long long int
#define F              first
#define S              second
#define pb             push_back
#define si             set <int>
#define vi             vector <int>
#define pii            pair <int, int>
#define vpi            vector <pii>
#define vpp            vector <pair<int, pii>>
#define mii            map <int, int>
#define mpi            map <pii, int>
#define spi            set <pii>
#define endl           "\n"
#define sz(x)          ((int) x.size())
#define all(p)         p.begin(), p.end()
#define double         long double
#define que_max        priority_queue <int>
#define que_min        priority_queue <int, vi, greater<int>>
#define bug(...)       __f (#__VA_ARGS__, __VA_ARGS__)
#define print(a)       for(auto x : a) cout << x << " "; cout << endl
#define print1(a)      for(auto x : a) cout << x.F << " " << x.S << endl
#define print2(a,x,y)  for(int i = x; i < y; i++) cout<< a[i]<< " "; cout << endl
#define REP(i,a,b)     for (int i = a; i <= b; i++)

inline int power(int a, int b)
{
    int x = 1;
    while (b)
    {
        if (b & 1) x *= a;
        a *= a;
        b >>= 1;
    }
    return x;
}

template <typename Arg1>
void __f (const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << endl; }
template <typename Arg1, typename... Args>
void __f (const char* names, Arg1&& arg1, Args&&... args)
{
    const char* comma = strchr (names + 1, ',');
    cout.write (names, comma - names) << " : " << arg1 << " | "; __f (comma + 1, args...);
}


void babazaHelper(string s1, string s2){
    int n = s1.size();
    // change all even one
    if(s1[0] != s2[0]){
        if(s1[1] == s2[0]){
            char tmp = s1[1] + 1;
            if(tmp == 'Z' + 1){
                tmp = 'Z' - 1;
            }
            s1[0] = tmp;
        }
        else {
            s1[0] = s2[0];
        }
    }
    for(int i = 2; i < n - 1; i+=2){
        if(s2[i] != s1[i-1] && s2[i]!= s1[i+1]){
            s1[i] = s2[i];
        }
        else{
            char tmp = s2[i] + 1;
            if(tmp == 'Z' + 1){
                tmp = 'Z' - 1;
            }
            s1[i] = tmp;
        }
    }

    if(n%2 == 1){
        if(s1[n-1] != s2[n-2]){
            s1[n-1] = s2[n-1];
        }
    }

    cout << s1 << endl;


    // change odd one

    for(int i = 1; i < n - 1; i+=2){
        if(s2[i] != s1[i-1] && s2[i]!= s1[i+1]){
            s1[i] = s2[i];
        }
        else{
            char tmp = s2[i] + 1;
            if(tmp == 'Z' + 1){
                tmp = 'Z' - 1;
            }
            s1[i] = tmp;
        }
    }

    if(n%2 == 0){
        if(s1[n-1] != s2[n-1]){
            s1[n-1] = s2[n-1];
        }
    }
    if(s1 == s2) return;
    cout << s1 << endl;
}


void solve() {
    /*
        the problem always return maximum 4 strings
    */
    string s1, s2;
    cin >> s1 >> s2;

    //edge case
    if(s1.size() == 1){
        cout << s1 << endl << s2; return;
    }

    int cnt = 0;
    
    cout << s1 << endl;
    babazaHelper(s1, s2);
    cout << s2 << endl;
}

int32_t main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    #ifndef ONLINE_JUDGE
        freopen("input.txt",  "r",  stdin);
        freopen("output.txt", "w", stdout);
    #endif

    clock_t z = clock();

    int t = 1;
    // cin >> t;
    while (t--) solve();

    cerr << "Run Time : " << ((double)(clock() - z) / CLOCKS_PER_SEC);

    return 0;
}

Test 1

Verdict: ACCEPTED

Run Time : 3.3e-05

Test 2

Verdict: ACCEPTED

Run Time : 3.3e-05

Test 3

Verdict: ACCEPTED

Run Time : 3.4e-05

Test 4

Verdict: WRONG ANSWER

Run Time : 3.4e-05

Test 5

Verdict: WRONG ANSWER

Run Time : 3.3e-05

Test 6

Verdict: ACCEPTED

Run Time : 3.3e-05

Test 7

Verdict: WRONG ANSWER

Run Time : 3.2e-05

Test 8

Verdict: ACCEPTED

Run Time : 3.3e-05

Test 9

Verdict: ACCEPTED

Run Time : 3.5e-05

Test 10

Verdict: ACCEPTED

Run Time : 3.3e-05

Test 11

Verdict: ACCEPTED

Run Time : 3.4e-05

Test 12

Verdict: WRONG ANSWER

Run Time : 3.4e-05

Test 13

Verdict: ACCEPTED

Run Time : 3.3e-05

Test 14

Verdict: WRONG ANSWER

Run Time : 3.3e-05