Climbing the Leaderboard Hackerrank problem help

Правка en5, от jiraiya_777, 2020-05-26 14:20:32

Hello Codeforces,

I was solving this problem on hackerrank.

I successfully solved it in (O(nlogm)) by submitting this (for hackkerank site). All test cases passed.

But this submission (for hackkerank site) (O(n+m)) passes all but fails this test case. Why??

Also when i try to implement the above solutions on my computer they run indefinitely on other test cases(which got accepted on hackerrank) for large values of n and m.

Help!!

Note- I have already solved the question in O(nlog(m)), so i tried for O(n+m) and this solution passed all but 1 test case.

I need help in knowing what's wrong with the 2nd approach.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en5 Английский jiraiya_777 2020-05-26 14:20:32 0 (published)
en4 Английский jiraiya_777 2020-05-26 14:19:47 30 (saved to drafts)
en3 Английский jiraiya_777 2020-05-26 14:12:28 240 Tiny change: 'lp!!\n\n**UPD**- I have' -> 'lp!!\n\n**Note**- I have'
en2 Английский jiraiya_777 2020-05-26 11:15:10 423
en1 Английский jiraiya_777 2020-05-25 20:30:58 759 Initial revision (published)