CSES - Aalto Competitive Programming 2026 - wk1 - Mon

Submission details
Task:	Babaza Game
Sender:	aalto26am_024
Submission time:	2026-08-31 17:58:20 +0300
Language:	Python3 (PyPy3)
Status:	READY
Result:	WRONG ANSWER

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

Code

from string import ascii_uppercase


s1 = input()
s2 = input()
n = len(s1)
print(s1)

s1 += ' '
s2 += ' '

wrong_idx = []

for i in range(len(s1)):
    if s1[i] != s2[i]:
        wrong_idx.append(i)

def find_char_not (strs):
    for c in ascii_uppercase:
        if c not in strs:
            return c

intermediate = s1[:]
wrong_idx.append(n)
i = 0
while i < len(wrong_idx):
    if i < len(wrong_idx) - 1 and wrong_idx[i+1] - wrong_idx[i] > 1:
        # intermediate[wrong_idx[i]] = s2 [wrong_idx[i]]
        intermediate = intermediate[:wrong_idx[i]] + s2 [wrong_idx[i]] + intermediate[wrong_idx[i] + 1:]

        i += 1
    elif i < len(wrong_idx) - 1 and s2[wrong_idx[i]] != s1[wrong_idx[i + 1]]:
        # intermediate[wrong_idx[i]] = s2 [wrong_idx[i]]
        intermediate = intermediate[:wrong_idx[i]] + s2 [wrong_idx[i]] + intermediate[wrong_idx[i] + 1:]

        i += 1
    elif i < len(wrong_idx) - 1 and s2[wrong_idx[i]] == s1[wrong_idx[i + 1]]:
        if s2[wrong_idx[i + 1]] == s1[wrong_idx[i]]:
            strs = []
            strs.append(s2[wrong_idx[i]])
            strs.append(s1[wrong_idx[i]])
            if i + 2 < len(wrong_idx):
                strs.append(s2[wrong_idx[i + 2]])
                strs.append(s1[wrong_idx[i + 2]])
            # intermediate[wrong_idx[i +1]] = find_char_not(strs)
            # print('----', i)
            # print(intermediate)
            # print(find_char_not(strs))
            intermediate = intermediate[:wrong_idx[i +1]] + find_char_not(strs) + intermediate[wrong_idx[i +1] + 1:]
            # print(intermediate)
            # print('----')
            flag = True
            i += 1
            # print(i, '---0000')
        else:
            pass
    i+=1


print(intermediate[:len(s2) - 1])
wrong_idx = []

for i in range(len(s2)):
    if intermediate[i] != s2[i]:
        wrong_idx.append(i)
intermediate_old = intermediate[:]
s1 = intermediate[:]
flag = False
wrong_idx.append(n)
i = 0
while i < len(wrong_idx):
    if i < len(wrong_idx) - 1 and wrong_idx[i+1] - wrong_idx[i] > 1:
        # intermediate[wrong_idx[i]] = s2 [wrong_idx[i]]
        intermediate = intermediate[:wrong_idx[i]] + s2 [wrong_idx[i]] + intermediate[wrong_idx[i] + 1:]

        i += 1
    elif i < len(wrong_idx) - 1 and s2[wrong_idx[i]] != s1[wrong_idx[i + 1]]:
        # intermediate[wrong_idx[i]] = s2 [wrong_idx[i]]
        intermediate = intermediate[:wrong_idx[i]] + s2 [wrong_idx[i]] + intermediate[wrong_idx[i] + 1:]

        i += 1
    elif i < len(wrong_idx) - 1 and s2[wrong_idx[i]] == s1[wrong_idx[i + 1]]:
        if s2[wrong_idx[i + 1]] == s1[wrong_idx[i]]:
            strs = []
            strs.append(s2[wrong_idx[i]])
            strs.append(s1[wrong_idx[i]])
            if i + 2 < len(wrong_idx):
                strs.append(s2[wrong_idx[i + 2]])
                strs.append(s1[wrong_idx[i + 2]])
            # intermediate[wrong_idx[i +1]] = find_char_not(strs)
            intermediate = intermediate[:wrong_idx[i +1]] + find_char_not(strs) + intermediate[wrong_idx[i +1] + 1:]
            flag = True
            i += 1
        else:
            pass
    i+=1

if intermediate != intermediate_old:
    print(intermediate[:len(s2) - 1])

if intermediate != s2:
    print(s2[:len(s2) - 1])

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: WRONG ANSWER

input
`BABAZA BACBCB` view save

correct output
`BABAZA BACACA BACBCB` view save

user output
`BABAZA BACACA BACBCA 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 ABD ACD BCD` view save

Test 5

Verdict: WRONG ANSWER

input
`AXYB CXYD` view save

correct output
`AXYB CXYD` view save

user output
`AXYB CXYB CXYD` view save

Test 6

Verdict: WRONG ANSWER

input
`LMIJLF PAQBMH` view save

correct output
`LMIJLF PMQJMF PAQBMH` view save

user output
`LMIJLF PMQJMF PAQJMH PAQBMH` view save

Test 7

Verdict: WRONG ANSWER

input
`PNIWLSLIH CRLVPUFHD` view save

correct output
`PNIWLSLIH CNLWPSFID CRLVPUFHD` view save

user output
`PNIWLSLIH CNLWPSFID CRLWPUFID CRLVPUFHD` view save

Test 8

Verdict: WRONG ANSWER

input
`ZDYIAVTKL ZJKVXGAUM` view save

correct output
`ZDYIAVTKL ZJYVAGTUL ZJKVXGAUM` view save

user output
`ZDYIAVTKL ZJYVAGTUL ZJKVAGAUL ZJKVXGAUM` view save

Test 9

Verdict: WRONG ANSWER

input
`FBIXISJH NXZIESMG` view save

correct output
`FBIXISJH NBZXESMH NXZIESMG` view save

user output
`FBIXISJH NBZXESJG NXZXESMG NXZIESMG` view save

Test 10

Verdict: WRONG ANSWER

input
`OPGW QJIE` view save

correct output
`OPGW QPIW QJIE` view save

user output
`OPGW QPIW QJIW QJIE` view save

Test 11

Verdict: WRONG ANSWER

input
`DUKNPKQZBL NZPBMOEBIC` view save

correct output
`DUKNPKQZBL NUPNMKEZIL NZPBMOEBIC` view save

user output
`DUKNPKQZBL NUPNMKEZIL NZPNMOEZIC NZPBMOEBIC` view save

Test 12

Verdict: WRONG ANSWER

input
`ZWDTX HZOXI` view save

correct output
`ZWDTX HWOTI HZOXI` view save

user output
`ZWDTX HWOTI HZOTI HZOXI` view save

Test 13

Verdict: WRONG ANSWER

input
`URJF ITIQ` view save

correct output
`URJF IRIF ITIQ` view save

user output
`URJF IRIF ITIF ITIQ` view save

Test 14

Verdict: WRONG ANSWER

input
`WYWBWU IRYVBA` view save

correct output
`WYWBWU WRWVWA IRYVBA` view save

user output
`WYWBWU IYYBBU IRYBBA IRYVBA` view save

Aalto Competitive Programming 2026 - 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 (aalto26am_024)