Submission details
Task:Babaza Game
Sender:aalto26am_033
Submission time:2026-09-01 00:13:39 +0300
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.04 sdetails
#2ACCEPTED0.04 sdetails
#3ACCEPTED0.04 sdetails
#4ACCEPTED0.04 sdetails
#5ACCEPTED0.04 sdetails
#60.04 sdetails
#7ACCEPTED0.04 sdetails
#8ACCEPTED0.04 sdetails
#9ACCEPTED0.04 sdetails
#100.04 sdetails
#11ACCEPTED0.04 sdetails
#12ACCEPTED0.04 sdetails
#130.04 sdetails
#14ACCEPTED0.04 sdetails

Code

def bestStep(start: str, goal: str):
    print(start)
    if start != goal:
        oneMove = True
        for i in range(0,len(start)-1):
            oneMove = oneMove and (start[i] == goal[i] or start[i+1] == goal[i+1])
        if oneMove:
            return bestStep(goal,goal)
        mustGoNext = [False for i in range(0,len(start))]
        for i in range(0,len(start)-1):
            mustGoNext[i+1] = mustGoNext[i+1] or (start[i+1] == goal[i])
            mustGoNext[i] = mustGoNext[i] or (start[i] == goal[i+1])
        for x in range(0,len(start)):
            for i in range(0,len(start)):
                if i+2 < len(start):
                    mustGoNext[i] = mustGoNext[i] or ((start[i] != goal[i]) and mustGoNext[i+2])
                if i-2 >= 0:
                    mustGoNext[i] = mustGoNext[i] or ((start[i] != goal[i]) and  mustGoNext[i-2])
        for i in range(1,len(start)-1):
            mustGoNext[i] = mustGoNext[i] or ((start[i] != goal[i]) and not mustGoNext[i-1] and not mustGoNext[i+1])

        twoMove = True
        for i in range(0,len(start)-1):
            twoMove = twoMove and not (mustGoNext[i] and mustGoNext[i+1])
        free = list(set(list(map(chr, range(ord('A'), ord('Z')+1)))).difference(set(list(start)).union(set(list(goal)))))[0]
        if twoMove:
            def helper(i):
                if mustGoNext[i]: 
                    return goal[i] 
                else: 
                    return start[i]
            
            return bestStep(''.join([helper(i) for i in range(0,len(start))]),goal)
        def helper2(i):
            if ((i%2) == 1): 
                return free 
            else: 
                return start[i]
        return bestStep(''.join([helper2(i) for i in range(0,len(start))]),goal)
                
                

bestStep(input(),input())

Test details

Test 1

Verdict: ACCEPTED

input
A
B

correct output
A
B

user output
A
B

Test 2

Verdict: ACCEPTED

input
BABAZA
BACBCB

correct output
BABAZA
BACACA
BACBCB

user output
BABAZA
BACACA
BACBCB

Test 3

Verdict: ACCEPTED

input
AB
BA

correct output
AB
CB
CA
BA

user output
AB
AC
BC
BA

Test 4

Verdict: ACCEPTED

input
ABC
BCD

correct output
ABC
DBD
DCD
BCD

user output
ABC
AEC
BED
BCD

Test 5

Verdict: ACCEPTED

input
AXYB
CXYD

correct output
AXYB
CXYD

user output
AXYB
CXYD

Test 6

Verdict:

input
LMIJLF
PAQBMH

correct output
LMIJLF
PMQJMF
PAQBMH

user output
LMIJLF
LAIBLF
LAQBMF
PAQBMH

Test 7

Verdict: ACCEPTED

input
PNIWLSLIH
CRLVPUFHD

correct output
PNIWLSLIH
CNLWPSFID
CRLVPUFHD

user output
PNIWLSLIH
CNLWPSFID
CRLVPUFHD

Test 8

Verdict: ACCEPTED

input
ZDYIAVTKL
ZJKVXGAUM

correct output
ZDYIAVTKL
ZJYVAGTUL
ZJKVXGAUM

user output
ZDYIAVTKL
ZJYVAGTUL
ZJKVXGAUM

Test 9

Verdict: ACCEPTED

input
FBIXISJH
NXZIESMG

correct output
FBIXISJH
NBZXESMH
NXZIESMG

user output
FBIXISJH
NBZXESMH
NXZIESMG

Test 10

Verdict:

input
OPGW
QJIE

correct output
OPGW
QPIW
QJIE

user output
OPGW
OJGW
OJIW
QJIE

Test 11

Verdict: ACCEPTED

input
DUKNPKQZBL
NZPBMOEBIC

correct output
DUKNPKQZBL
NUPNMKEZIL
NZPBMOEBIC

user output
DUKNPKQZBL
NUPNMKEZIL
NZPBMOEBIC

Test 12

Verdict: ACCEPTED

input
ZWDTX
HZOXI

correct output
ZWDTX
HWOTI
HZOXI

user output
ZWDTX
HWOTI
HZOXI

Test 13

Verdict:

input
URJF
ITIQ

correct output
URJF
IRIF
ITIQ

user output
URJF
UTJF
UTIF
ITIQ

Test 14

Verdict: ACCEPTED

input
WYWBWU
IRYVBA

correct output
WYWBWU
WRWVWA
IRYVBA

user output
WYWBWU
WRWVWA
IRYVBA