CSES - Aalto Competitive Programming 2025 - wk3 - Wed

Submission details
Task:	Spin-Pop-Squeeze-Clap
Sender:	aalto25c_003
Submission time:	2025-09-17 17:47:16 +0300
Language:	Python3 (PyPy3)
Status:	READY
Result:	TIME LIMIT EXCEEDED

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	TIME LIMIT EXCEEDED	--	details
#7	ACCEPTED	0.20 s	details
#8	ACCEPTED	4.83 s	details
#9	ACCEPTED	1.04 s	details
#10	ACCEPTED	0.13 s	details
#11	ACCEPTED	1.13 s	details
#12	ACCEPTED	0.88 s	details
#13	ACCEPTED	1.35 s	details
#14	ACCEPTED	0.49 s	details
#15	ACCEPTED	0.28 s	details
#16	ACCEPTED	2.43 s	details
#17	ACCEPTED	1.35 s	details
#18	ACCEPTED	0.23 s	details
#19	ACCEPTED	0.24 s	details
#20	ACCEPTED	0.12 s	details
#21	ACCEPTED	0.13 s	details
#22	ACCEPTED	1.51 s	details
#23	ACCEPTED	1.65 s	details
#24	ACCEPTED	0.71 s	details
#25	ACCEPTED	3.31 s	details
#26	ACCEPTED	5.13 s	details
#27	ACCEPTED	0.55 s	details
#28	TIME LIMIT EXCEEDED	--	details
#29	TIME LIMIT EXCEEDED	--	details
#30	ACCEPTED	3.95 s	details
#31	ACCEPTED	1.44 s	details
#32	ACCEPTED	2.52 s	details
#33	ACCEPTED	4.07 s	details
#34	ACCEPTED	0.38 s	details
#35	ACCEPTED	2.15 s	details

Code

from sys import setrecursionlimit
setrecursionlimit(int(1E5))

numA = [int(kk) for kk in input().strip()]
numB = [int(kk) for kk in input().strip()]
# print(numA, numB)



def ff(aa, bb, spin, myCache):
    if aa == -1:
        return bb+1
    if bb == -1:
        return aa+1
    if myCache[bb][aa] != -1:
        return myCache[bb][aa]
    # print(spin)
    mi = min(
        ff(aa, bb-1, spin, myCache)+1, 
        ff(aa-1, bb, spin, myCache)+1, 
        ff(aa-1, bb-1, spin, myCache)+(0 if (numA[aa]+spin)%10 == (numB[bb]) else 1),
        # ff(aa-1, bb-1, spin+1, myCache)+1
        )
    myCache[bb][aa] = mi
    return mi
def printCache(myCache):
    for line in myCache:
        for ch in line:
            print(ch,end=" ")
        print()

mi = int(1E9)
allSame = True
for ii, jj in zip(numA, numB):
    if ii != jj:
        allSame = False
        break
if allSame:
    print(0)
    exit()

for spin in range(10):
    myCache =[[-1 for _ in range(len(numA))] for _ in range(len(numB))]
    # print(spin, )
    ret = ff(len(numA)-1, len(numB)-1, spin, myCache)
    # print(spin, ret)
    if spin + ret < mi:
        # print(spin,mi)
        mi = spin + ret
    # brea
print(mi)

Test details

Test 1

Verdict: ACCEPTED

input
`111222 283303` view save

correct output
`4` view save

user output
`4` view save

Test 2

Verdict: ACCEPTED

input
`123123 54545` view save

correct output
`4` view save

user output
`4` view save

Test 3

Verdict: ACCEPTED

input
`111 222` view save

correct output
`1` view save

user output
`1` view save

Test 4

Verdict: ACCEPTED

input
`999 999` view save

correct output
`0` view save

user output
`0` view save

Test 5

Verdict: ACCEPTED

input
`450 57` view save

correct output
`2` view save

user output
`2` view save

Test 6

Verdict: TIME LIMIT EXCEEDED

input
`660487647593824219489241157815...` view save

correct output
`674` view save

user output
(empty)

Test 7

Verdict: ACCEPTED

input
`914177763170669074391500080636...` view save

correct output
`130` view save

user output
`130` view save

Test 8

Verdict: ACCEPTED

input
`011524493909266858784005756682...` view save

correct output
`681` view save

user output
`681` view save

Test 9

Verdict: ACCEPTED

input
`982597919074833788762328601290...` view save

correct output
`717` view save

user output
`717` view save

Test 10

Verdict: ACCEPTED

input
`416721106840388542143044324451...` view save

correct output
`215` view save

user output
`215` view save

Test 11

Verdict: ACCEPTED

input
`458073021573681930364262129972...` view save

correct output
`473` view save

user output
`473` view save

Test 12

Verdict: ACCEPTED

input
`917400297550473688139849165156...` view save

correct output
`699` view save

user output
`699` view save

Test 13

Verdict: ACCEPTED

input
`260181590830166131860913909960...` view save

correct output
`584` view save

user output
`584` view save

Test 14

Verdict: ACCEPTED

input
`562301238360777679361730486761...` view save

correct output
`284` view save

user output
`284` view save

Test 15

Verdict: ACCEPTED

input
`954220587915890627622301289161...` view save

correct output
`416` view save

user output
`416` view save

Test 16

Verdict: ACCEPTED

input
`067903774208751350629566447245...` view save

correct output
`442` view save

user output
`442` view save

Test 17

Verdict: ACCEPTED

input
`877893287921742180967929081003...` view save

correct output
`358` view save

user output
`358` view save

Test 18

Verdict: ACCEPTED

input
`485260574793809275253093185610...` view save

correct output
`442` view save

user output
`442` view save

Test 19

Verdict: ACCEPTED

input
`423232218340629042147624537896...` view save

correct output
`192` view save

user output
`192` view save

Test 20

Verdict: ACCEPTED

input
`983444174766143554582284201195...` view save

correct output
`83` view save

user output
`83` view save

Test 21

Verdict: ACCEPTED

input
`308023002531575464533553486397...` view save

correct output
`984` view save

user output
`984` view save

Test 22

Verdict: ACCEPTED

input
`774637064330445294039402907794...` view save

correct output
`544` view save

user output
`544` view save

Test 23

Verdict: ACCEPTED

input
`645428410366485628023288358114...` view save

correct output
`378` view save

user output
`378` view save

Test 24

Verdict: ACCEPTED

input
`175337727474341582323359837344...` view save

correct output
`695` view save

user output
`695` view save

Test 25

Verdict: ACCEPTED

input
`081836584929414654154099313187...` view save

correct output
`493` view save

user output
`493` view save

Test 26

Verdict: ACCEPTED

input
`241592066112579763355561876139...` view save

correct output
`630` view save

user output
`630` view save

Test 27

Verdict: ACCEPTED

input
`664737828830059612330669705871...` view save

correct output
`559` view save

user output
`559` view save

Test 28

Verdict: TIME LIMIT EXCEEDED

input
`230972151340592860909446321989...` view save

correct output
`696` view save

user output
(empty)

Test 29

Verdict: TIME LIMIT EXCEEDED

input
`410946685234703970117608650309...` view save

correct output
`691` view save

user output
(empty)

Test 30

Verdict: ACCEPTED

input
`692323212407710827747149254185...` view save

correct output
`536` view save

user output
`536` view save

Test 31

Verdict: ACCEPTED

input
`034704049619193895285878119956...` view save

correct output
`467` view save

user output
`467` view save

Test 32

Verdict: ACCEPTED

input
`336980270982636303223976539004...` view save

correct output
`543` view save

user output
`543` view save

Test 33

Verdict: ACCEPTED

input
`744311485456233719196607507429...` view save

correct output
`570` view save

user output
`570` view save

Test 34

Verdict: ACCEPTED

input
`289232763326229330631165228849...` view save

correct output
`563` view save

user output
`563` view save

Test 35

Verdict: ACCEPTED

input
`159941856600173517598637236698...` view save

correct output
`431` view save

user output
`431` view save

Aalto Competitive Programming 2025 - wk3 - Wed

Spin-Pop-Squeeze-Clap

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

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Tasks

Submissions (aalto25c_003)