SEATSR-Editorial

dhruvchandhok · October 15, 2014, 12:43pm

Yeah that works , thanks @kaushik_iiitd

ak29 · October 16, 2014, 11:54pm

your solution fails for this test case
1
abcde
aa
0 1 0
exp ans=0
your ans=-1
try returning 0 whenever value of a=0(there are definitely some cases regarding this as i was too stuck) since there is no need for further computation as deleting the entire first string and inserting the other would take 0 min operations

vkrishna17 · October 17, 2014, 3:26am

guys do some smart work… instead of pasting your entire code … simply provide a link to your solution… it will be more friendly to others…

tonthatvinh · October 18, 2014, 10:04am

I’m trying to solve this problems with above idea, but I get WA, I don’t know what’s wrong with my code?
Here is my code : http://www.codechef.com/viewsolution/5163464
Could anyone give me a hint why I’m wrong?
Thank you! ^^

gm_krishna5 · October 18, 2014, 10:18pm

Please update author’s solution

yashkumar18 · October 19, 2014, 2:04am

Author’s and Setter’s solutions please

khooni_khopri · October 19, 2014, 2:36pm

Please update author’s and tester’s solution…

sagar0430 · October 19, 2014, 7:39pm

Can anyone explain Restricted Edit Distance in some another manner ?

I’m not able to understand that how we are going to reduce the size of the array d that we are using to store edit distance.

murdocc007 · October 20, 2014, 10:27am

Shouldn’t

P[i][delta] = P[i - 1][delta], if s[i] == w[i + delta] ?

rahugur · October 21, 2014, 4:01am

@admin When exactly you will be putting author and tester’s solution?

Ordinary_Sheep · October 29, 2014, 3:08am

waiting for authors solution…

prashant_93_y · May 5, 2015, 11:50pm

Waiting for author’s, setter’s and editorialist’s solution, DAY 201

sharru05 · May 6, 2015, 2:12am

nice editorial.

gkcs · May 12, 2018, 5:46pm

Hey guys, I made a video editorial on this technique here:

https://youtu.be/7GCSA4u5ynw

It’s been a long while, but the algorithm is still great!

Cheers!