Please see this

Yesterday was Starters 173 (Rated upto < 2700) I am talking about problem- https://www.codechef.com/problems/MINOVER?tab=statement

This was 3rd problem called Overwrite

I couldn't solve this during the contest due to panic and pressure, today I tried looking into it deeply. These are my findings -

1) Correct Soln ( This is most voted ) — https://www.codechef.com/viewsolution/1132142555

Verdict- Accepted

2) I copy pasted same code(after contest) — https://www.codechef.com/viewsolution/1132570276

Verdict — TLE

How did possibly the same codes worked differently? The approach used and time complexity is same in my code too

https://www.codechef.com/viewsolution/1132226217 (This was during contest again tle)

Need feedback from the community on this issue.

Edit: found the submission O(n+m)

Link- https://www.codechef.com/viewsolution/1132254669

Complexity of problematic code is O( (n-m)*m) (i hoped that it might work)

But still it feels bad with such compiler level inconsistencies