Babaza Game

input/code.cpp: In function 'int main()':
input/code.cpp:40:9: warning: unused variable 'last_index_diff' [-Wunused-variable]
   40 |     int last_index_diff = -2;
      |         ^~~~~~~~~~~~~~~

#include <bits/stdc++.h>

using namespace std;

string avoid(string& s, string& e, int i) {

    int q = 0;
    vector<string> letters = {"A", "B", "C", "D", "E", "F"};
    int n = s.size();
    while (true) {

        q++;
        char l = letters[q][0];
        if (i > 0 && (s[i-1] == (char)l || e[i-1] == (char)l)) {
            continue;
        }

        if (i < n-1 && (s[i+1] == (char)l || e[i+1] == (char)l)) {
            continue;
        }

        return letters[q];

    }

}

int main() {

    string s, e;
    cin >> s >> e;

    int n = s.size();

    // if (n == 1 || s == e) {
    //     cout << s << endl << e << endl;
    //     return 0;
    // }

    int last_index_diff = -2;
    bool oneposs = true;
    for (int i = 0; i < n-1; i++) {
        if (s[i] != e[i] && s[i+1] != e[i+1]) {
            oneposs = false;
            break;
        }
    }
    
    if (oneposs) {
        cout << s << endl << e << endl;
        return 0;
    }

    int m = (1 << n);

    for (int i = 0; i < m; i++) {

        string w = "";
        int cont = 0;
        int anticont = 0;
        bool valid = true;
        

        for (int j = 0; j < n; j++) {
            if ((1 << j) & i) {
                w += s[j];
                cont = 0;
                anticont++;
                if (anticont > 1) valid = false;
            } else {
                w += e[j];
                cont++;
                if (cont > 1) valid = false;
                anticont = 0;
            }
        }

        for (int i = 0; i < n-1; i++) {
            if (w[i] == w[i+1]) {
                valid = false;
            }
        }

        if (valid) {
            cout << s << endl << w << endl << e << endl;
            return 0;
        }

    }

    cout << s << endl;
    for (int i = 0; i < n; i++) {
        if (i % 2 == 0) {
            cout << s[i];
        } else {
            cout << avoid(s, e, i);
        }
    }
    cout << endl;
    for (int i = 0; i < n; i++) {
        if (i % 2 == 0) {
            cout << e[i];
        } else {
            cout << avoid(s, e, i);
        }
    }
    cout << endl;
    cout << e << endl;

}

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