Submission details
Task:Edit distance
Sender:Wu xiaobo
Submission time:2020-09-12 14:23:10 +0300
Language:Python3 (CPython3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.02 sdetails
#2ACCEPTED0.02 sdetails
#3ACCEPTED0.02 sdetails
#4ACCEPTED0.02 sdetails
#5ACCEPTED0.02 sdetails
#6--details
#7--details
#8--details
#9--details
#10--details
#11ACCEPTED0.02 sdetails
#12ACCEPTED0.02 sdetails
#13ACCEPTED0.02 sdetails
#14ACCEPTED0.02 sdetails
#15ACCEPTED0.03 sdetails
#16--details
#17ACCEPTED0.03 sdetails
#18--details
#19ACCEPTED0.02 sdetails

Code

# from collections import deque
# word1 = input()
# word2 = input()
#
# visit, q = set(), deque([(word1, word2, 0)])
# while True:
#     w1, w2, d = q.popleft()
#     if (w1, w2) not in visit:
#         if w1 == w2:
#             print(d)
#             break
#         visit.add((w1, w2))
#         while w1 and w2 and w1[0] == w2[0]:
#             w1, w2= w1[1:], w2[1:]
#         d += 1
#         q.extend([(w1[1:], w2[1:], d), (w1, w2[1:], d), (w1[1:], w2, d)])

word1 = input()
word2 = input()
if not word1:
    print(len(word2 or '') or 0)
elif not word2:
    print(len(word1 or '') or 0)
else:
    size1 = len(word1)
    size2 = len(word2)

    last = 0
    tmp = list(range(size2 + 1))
    value = None

    for i in range(size1):
        tmp[0] = i + 1
        last = i
        # print word1[i], last, tmp
        for j in range(size2):
            if word1[i] == word2[j]:
                value = last
            else:
                value = 1 + min(last, tmp[j], tmp[j + 1])
                # print(last, tmp[j], tmp[j + 1], value)
            last = tmp[j+1]
            tmp[j+1] = value
        # print tmp
    print(value)

Test details

Test 1

Verdict: ACCEPTED

input
NEABJPJOI
RFMQRJKJKIA

correct output
8

user output
8

Test 2

Verdict: ACCEPTED

input
TWXFUABGBNLTBFNSUVQW
GPNJILFXJUIZPLTVUIB

correct output
19

user output
19

Test 3

Verdict: ACCEPTED

input
HSMOWJXKGRWSMD
JMRTLLNPXKKXZC

correct output
14

user output
14

Test 4

Verdict: ACCEPTED

input
NGPYCNPO
UQPXWVLGHC

correct output
9

user output
9

Test 5

Verdict: ACCEPTED

input
SQTCKWAMFJEBV
IUWGGNJOMQFP

correct output
13

user output
13

Test 6

Verdict:

input
VDREWLLHMEVGFGBXJJOSSLHNJBOTRK...

correct output
4047

user output
(empty)

Test 7

Verdict:

input
EIIUUQXSAFMTRSEZSFYNSAGHUWTSGY...

correct output
3769

user output
(empty)

Test 8

Verdict:

input
HVOXUVAZYFBKEWQXVGJMYXCCXBWRNW...

correct output
3806

user output
(empty)

Test 9

Verdict:

input
AWGASQANDZQTVKXQDKWNADQDBXKCOK...

correct output
4069

user output
(empty)

Test 10

Verdict:

input
WXAAJJALZRLGLSXDPUPURULYINBFGX...

correct output
3874

user output
(empty)

Test 11

Verdict: ACCEPTED

input
A
A

correct output
0

user output
0

Test 12

Verdict: ACCEPTED

input
A
B

correct output
1

user output
1

Test 13

Verdict: ACCEPTED

input
AA
A

correct output
1

user output
1

Test 14

Verdict: ACCEPTED

input
A
AA

correct output
1

user output
1

Test 15

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
5000

user output
5000

Test 16

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
0

user output
(empty)

Test 17

Verdict: ACCEPTED

input
B
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
5000

user output
5000

Test 18

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
5000

user output
(empty)

Test 19

Verdict: ACCEPTED

input
KITTEN
SITTING

correct output
3

user output
3