CSES - Aalto Competitive Programming 2026 - wk1 - Mon

Submission details
Task:	Babaza Game
Sender:	aalto26am_033
Submission time:	2026-09-01 00:06:05 +0300
Language:	Python3 (PyPy3)
Status:	READY
Result:	RUNTIME ERROR

Test results
test	verdict	time
#1	ACCEPTED	0.04 s	details
#2	ACCEPTED	0.04 s	details
#3	ACCEPTED	0.04 s	details
#4	ACCEPTED	0.04 s	details
#5	ACCEPTED	0.04 s	details
#6	RUNTIME ERROR	0.17 s	details
#7	ACCEPTED	0.04 s	details
#8	RUNTIME ERROR	0.16 s	details
#9	ACCEPTED	0.04 s	details
#10	RUNTIME ERROR	0.15 s	details
#11	ACCEPTED	0.04 s	details
#12	ACCEPTED	0.04 s	details
#13	RUNTIME ERROR	0.15 s	details
#14	ACCEPTED	0.04 s	details

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])

        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` 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: RUNTIME ERROR

input
`LMIJLF PAQBMH` view save

correct output
`LMIJLF PMQJMF PAQBMH` view save

user output
`LMIJLF LMIJLF LMIJLF LMIJLF LMIJLF ...` view save

Error:

Traceback (most recent call last):
  File "/box/input/code.py", line 42, in <module>
    bestStep(input(),input())
  File "/box/input/code.py", line 32, in bestStep
    return bestStep(''.join([helper(i) for i in range(0,len(start))]),goal)
  File "/box/input/code.py", line 32, in bestStep
    return bestStep(''.join([helper(i) for i in range(0,len(start))]),goal)
  File "/box/input/code.py", line 32, in bestStep
    return bestStep(''.join([helper(i) for i in range(0,len(start))]),goal)
  [Previous line repeated 1322 more times]
  File "/box/input/code.py", line 3, in bestStep
    print(start)
RecursionError: maximum recursion depth exceeded

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: RUNTIME ERROR

input
`ZDYIAVTKL ZJKVXGAUM` view save

correct output
`ZDYIAVTKL ZJYVAGTUL ZJKVXGAUM` view save

user output
`ZDYIAVTKL ZDYIAVTKL ZDYIAVTKL ZDYIAVTKL ZDYIAVTKL ...` view save

Error:

Traceback (most recent call last):
  File "/box/input/code.py", line 42, in <module>
    bestStep(input(),input())
  File "/box/input/code.py", line 32, in bestStep
    return bestStep(''.join([helper(i) for i in range(0,len(start))]),goal)
  File "/box/input/code.py", line 32, in bestStep
    return bestStep(''.join([helper(i) for i in range(0,len(start))]),goal)
  File "/box/input/code.py", line 32, in bestStep
    return bestStep(''.join([helper(i) for i in range(0,len(start))]),goal)
  [Previous line repeated 1320 more times]
  File "/box/input/code.py", line 3, in bestStep
    print(start)
RecursionError: maximum recursion depth exceeded

Test 9

Verdict: ACCEPTED

input
`FBIXISJH NXZIESMG` view save

correct output
`FBIXISJH NBZXESMH NXZIESMG` view save

user output
`FBIXISJH NBZXESMH NXZIESMG` view save

Test 10

Verdict: RUNTIME ERROR

input
`OPGW QJIE` view save

correct output
`OPGW QPIW QJIE` view save

user output
`OPGW OPGW OPGW OPGW OPGW ...` view save

Error:

Traceback (most recent call last):
  File "/box/input/code.py", line 42, in <module>
    bestStep(input(),input())
  File "/box/input/code.py", line 32, in bestStep
    return bestStep(''.join([helper(i) for i in range(0,len(start))]),goal)
  File "/box/input/code.py", line 32, in bestStep
    return bestStep(''.join([helper(i) for i in range(0,len(start))]),goal)
  File "/box/input/code.py", line 32, in bestStep
    return bestStep(''.join([helper(i) for i in range(0,len(start))]),goal)
  [Previous line repeated 1332 more times]
  File "/box/input/code.py", line 3, in bestStep
    print(start)
RecursionError: maximum recursion depth exceeded

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: RUNTIME ERROR

input
`URJF ITIQ` view save

correct output
`URJF IRIF ITIQ` view save

user output
`URJF URJF URJF URJF URJF ...` view save

Error:

Traceback (most recent call last):
  File "/box/input/code.py", line 42, in <module>
    bestStep(input(),input())
  File "/box/input/code.py", line 32, in bestStep
    return bestStep(''.join([helper(i) for i in range(0,len(start))]),goal)
  File "/box/input/code.py", line 32, in bestStep
    return bestStep(''.join([helper(i) for i in range(0,len(start))]),goal)
  File "/box/input/code.py", line 32, in bestStep
    return bestStep(''.join([helper(i) for i in range(0,len(start))]),goal)
  [Previous line repeated 1332 more times]
  File "/box/input/code.py", line 3, in bestStep
    print(start)
RecursionError: maximum recursion depth exceeded

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 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_033)