CSES - Aalto Competitive Programming 2024 - wk1 - Mon

CSES - Aalto Competitive Programming 2024 - wk1 - Mon - Results

Submission details
Task:	Babaza Game
Sender:	auni
Submission time:	2024-09-04 14:10:05 +0300
Language:	C++ (C++17)
Status:	READY
Result:	ACCEPTED

Test results
test	verdict
#1	ACCEPTED	details
#2	ACCEPTED	details
#3	ACCEPTED	details
#4	ACCEPTED	details
#5	ACCEPTED	details
#6	ACCEPTED	details
#7	ACCEPTED	details
#8	ACCEPTED	details
#9	ACCEPTED	details
#10	ACCEPTED	details
#11	ACCEPTED	details
#12	ACCEPTED	details
#13	ACCEPTED	details
#14	ACCEPTED	details

Code

#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++)

void solve(string &a, string &b, string &helper, vector<pii> intervals, char c) {

    vector<bool> didE(intervals.size(), false); vector<bool> didO(intervals.size(), false);
    
    REP(i, 0, (int)intervals.size()) {
        bool canOdd = true;
        bool canEven = true;
        pii inter = intervals[i];
        int l = inter.F; int r = inter.S;
        
        for(int j = l; j <= r; j+=2) {
            if(b[j] == helper[j] || b[j] == helper[j+2]) {
                canOdd = false;
            }
        }
        for(int j = l+1; j <= r; j+=2) {
            if(b[j] == helper[j] || b[j] == helper[j+2]) {
                canEven = false;
            }
        }
        if(canEven) {
            didE[i] = true;
            for(int j = l+1; j <= r; j+=2) {
                a[j] = b[j];
            }
    
        } else if(canOdd) {
            didO[i] = true;
            for(int j = l; j <= r; j+=2) {
                a[j] = b[j];
            }
    
        } else {
            for(int j = l+1; j <= r; j+=2) {
                a[j] = c;
            }
        }
    }

    cout << a << "\n";

    REP(i, 0, (int)intervals.size()) {
        pii inter = intervals[i];
        int l = inter.F; int r = inter.S;
        
        if(didE[i]) {
            for(int j = l; j <= r; j+=2) {
                a[j] = b[j];
            }
        } else if(didO[i]) {
            for(int j = l+1; j <= r; j+=2) {
                a[j] = b[j];
            }
        } else {
            for(int j = l; j <= r; j+=2) {
                a[j] = b[j];
            }
        }
    }

    cout << a << "\n";
    bool all = true;

    REP(i, 0, (int)intervals.size()) {
        pii inter = intervals[i];
        int l = inter.F; int r = inter.S;
        
        if(!didO[i] && !didE[i]) {
            for(int j = l+1; j <= r; j+=2) {
                a[j] = b[j];
            }
            all = false;
        }
    }

    if(!all) cout << a << "\n";
  
}


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

    string a, b;
    cin >> a >> b;
    int n = a.length();
    vector<int> ind;
    vector<pii> intervals;

    cout << a << "\n";
    string helper = 'a' + a + 'a';

    bool can1 = true;

    REP(i, 0, n) {
        if(a[i] != b[i]) ind.PB(i);
    }
    REP(i, 0, (int)ind.size()-1) {

        if(ind[i] - ind[i+1] == -1) {

            int l = ind[i];
            int r = ind[i];
            can1 = false;
            while(i+1 < n && ind[i] - ind[i+1] == -1) {
                r++;
                i++;
            }
            intervals.PB(MP(l, r));
        }
    }

    if(can1) {
        REP(i, 0, (int)ind.size()) {
            a[ind[i]] = b[ind[i]];
        }
        cout << a << "\n";
        return 0;
    } else {
        char rpl = 'A';
        for(char c = 'A'; c <= 'Z'; ++c) {
            if(a.find(c) == string::npos && b.find(c) == string::npos) {
                rpl = c;
                break;
            }
        }
        solve(a, b, helper, intervals, rpl);
    }

    return 0;
    
}

Test details

Test 1

Verdict: ACCEPTED

input
`A B` view save

correct output
`A B` view save

user output
`A B` view save

Test 2

Verdict: ACCEPTED

input
`BABAZA BACBCB` view save

correct output
`BABAZA BACACA BACBCB` view save

user output
`BABAZA BACACA BACBCB` view save

Test 3

Verdict: ACCEPTED

input
`AB BA` view save

correct output
`AB CB CA BA` view save

user output
`AB AC BC BA` view save

Test 4

Verdict: ACCEPTED

input
`ABC BCD` view save

correct output
`ABC DBD DCD BCD` view save

user output
`ABC AEC BED BCD` view save

Test 5

Verdict: ACCEPTED

input
`AXYB CXYD` view save

correct output
`AXYB CXYD` view save

user output
`AXYB CXYD` view save

Test 6

Verdict: ACCEPTED

input
`LMIJLF PAQBMH` view save

correct output
`LMIJLF PMQJMF PAQBMH` view save

user output
`LMIJLF LAIBLH PAQBMH` view save

Test 7

Verdict: ACCEPTED

input
`PNIWLSLIH CRLVPUFHD` view save

correct output
`PNIWLSLIH CNLWPSFID CRLVPUFHD` view save

user output
`PNIWLSLIH CNLWPSFID CRLVPUFHD` view save

Test 8

Verdict: ACCEPTED

input
`ZDYIAVTKL ZJKVXGAUM` view save

correct output
`ZDYIAVTKL ZJYVAGTUL ZJKVXGAUM` view save

user output
`ZDYIAVTKL ZDKIXVAKM ZJKVXGAUM` view save

Test 9

Verdict: ACCEPTED

input
`FBIXISJH NXZIESMG` view save

correct output
`FBIXISJH NBZXESMH NXZIESMG` view save

user output
`FBIXISJH NBZXESJG NXZIESMG` view save

Test 10

Verdict: ACCEPTED

input
`OPGW QJIE` view save

correct output
`OPGW QPIW QJIE` view save

user output
`OPGW OJGE QJIE` view save

Test 11

Verdict: ACCEPTED

input
`DUKNPKQZBL NZPBMOEBIC` view save

correct output
`DUKNPKQZBL NUPNMKEZIL NZPBMOEBIC` view save

user output
`DUKNPKQZBL NUPNMKEZIL NZPBMOEBIC` view save

Test 12

Verdict: ACCEPTED

input
`ZWDTX HZOXI` view save

correct output
`ZWDTX HWOTI HZOXI` view save

user output
`ZWDTX HWOTI HZOXI` view save

Test 13

Verdict: ACCEPTED

input
`URJF ITIQ` view save

correct output
`URJF IRIF ITIQ` view save

user output
`URJF UTJQ ITIQ` view save

Test 14

Verdict: ACCEPTED

input
`WYWBWU IRYVBA` view save

correct output
`WYWBWU WRWVWA IRYVBA` view save

user output
`WYWBWU WRWVWA IRYVBA` view save

Aalto Competitive Programming 2024 - wk1 - Mon

Babaza Game

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Tasks

Submissions (auni)