Babaza Game

#include "bits/stdc++.h"

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define F first
#define S second
#define PB push_back
#define MP make_pair

#define REP(i,a,b) for (int i = a; i < b; i++)


int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    string a, b;
    cin >> a >> b;
    int n = a.length();

    cout << a << "\n";

    bool canEven = true;
    for(int i = 0; i < n; i+=2) {
        if(a[i] != b[i]) {
            canEven = false;
        }
    }

    bool canOdd = true;
    for(int i = 1; i < n; i+=2) {
        if(a[i] != b[i]) {
            canOdd = false;
        }
    }

    if(canOdd & canEven) {

    } else if(canOdd) {
        for(int i = 0; i < n; i+=2) {
            a[i] = b[i];
        }
    
        cout << a << "\n";

    } else if(canEven) {
        for(int i = 1; i < n; i+=2) {
            a[i] = b[i];
        }
        
        cout << a << "\n";
    } else {
        // CORE HERE
        canOdd = true;
        canEven = true;
        for(int i = 1; i < n; i+=2) {
            if((i != n-1) && ((b[i] == a[i-1]) || (b[i] == a[i+1]))) {
                canEven = false;
            } else if((i == n-1) && (b[i] == a[i-1])) {
                canEven = false;
            }

        }
        for(int i = 0; i < n; i+=2) {
            if(((i != 0) && (i != n-1)) && ((b[i] == a[i-1]) || (b[i] == a[i+1]))) {
                canOdd = false;
            } else if(((i == 0) && (i != n-1)) && (b[i] == a[i+1])) {
                canOdd = false;
            } else if(((i != 0) && (i == n-1)) && (b[i] == a[i-1])) {
                canOdd = false;
            }
        }
        // CORE HERE
        if(canOdd) {
            
            for(int i = 0; i < n; i+=2) {
                a[i] = b[i];
            }
            cout << a << "\n";
            for(int i = 1; i < n; i+=2) {
                a[i] = b[i];
            }
            cout << a << "\n";
        } else if(canEven) {
            
            for(int i = 1; i < n; i+=2) {
                a[i] = b[i];
            }
            cout << a << "\n";
            for(int i = 0; i < n; i+=2) {
                a[i] = b[i];
            }
            cout << a << "\n";
        } else {
            bool found = false;
            char c = 'A'-1;

            while(!found) {
                ++c;
                found = true;
                for(int j = 0; j < n; ++j) {
                    if(a[j] == c || b[j] == c) {
                        found = false;
                        break;
                    }
                }
            }
            for(int i = 0; i < n; i+=2) {
                a[i] = c;
            }
            cout << a << "\n";
            for(int i = 1; i < n; i+=2) {
                a[i] = b[i];
            }
            cout << a << "\n";
            for(int i = 0; i < n; i+=2) {
                a[i] = b[i];
            }
            cout << a << "\n";
        }

    }

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

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