GuptaJi's blog

By GuptaJi, history, 4 years ago, In English

I HAD TRIED THIS QUESTION MANY TIMES STILL I GOT TIME LIMIT EXCEEDED ON TEST 18 EVERY TIME . I EVEN USED FEN WICK TREE WHICH IS REQUIRED TO OPTIMISED IN THIS QUESTION . TO THE BEST OF MY KNOWLEDGE I AM DOING GOOD STILL NOT ABLE TO DEBUG IT . PLZ SOMEONE HELP .

THE PROBLEM NAME IS — STRING REVERSAL (1430E)

SUBMISSION LINK- https://codeforces.net/contest/1430/submission/95628601

QUESTION LINK -https://codeforces.net/contest/1430/problem/E

THNX IN ADVANCE :))

UPDATED:DONE NOW ..SO NOW U CAN IGNORE IT ALSO

  • Vote: I like it
  • -25
  • Vote: I do not like it

| Write comment?
»
4 years ago, # |
  Vote: I like it +2 Vote: I do not like it

Don't do "arr[temp].remove(0)"(it takes linear time) use array of stack/queue instead.

»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

You should check out SecondThread's youtube channel. link:https://www.youtube.com/channel/UCXbCohpE9IoVQUD2Ifg1d1g