Help Needed in observing TC of a Solution!

Revision en4, by akash.garg2172, 2021-08-02 15:04:48
Your code here...

I have tried this q :Aquamoon and Stolen String

And wrote the following code:

CODE

As per what I can observe my code is O(n*m) and in the q its mentioned that It is guaranteed that n is odd and that the sum of n⋅m over all test cases does not exceed 10^5.

But still my code is giving TLE in test case 2.

plz help me with its complexity

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English akash.garg2172 2021-08-02 15:04:48 0 (published)
en3 English akash.garg2172 2021-08-02 15:02:32 16 (saved to drafts)
en2 English akash.garg2172 2021-08-02 15:01:16 50 Tiny change: '\n~~~~~\nYou' -> '~~~~~\nYou'
en1 English akash.garg2172 2021-08-02 15:00:40 1562 Initial revision (published)