Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

_Untrackable_'s blog

By _Untrackable_, history, 12 days ago, In English

could anyone tell me why i am getting tle on test case 41? my solution is of o(nlogn) {if i am not wrong} . and by seeing constraints it should pass the testcases?. anyone?

sumbission link :- https://mirror.codeforces.com/contest/1902/submission/256209886

Full text and comments »

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

By _Untrackable_, history, 8 months ago, In English

Is there any way to tell the no of subsequences of a given string with all unique elements.. I had used recursion but gets TLE. anyone have any optimal answer?

Full text and comments »

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

By _Untrackable_, history, 8 months ago, In English

Is anyone have recursive dp solution of div2 892D?

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

By _Untrackable_, history, 9 months ago, In English

In codeforces Educational Codeforces Round 123, C question (Increase Subarray Sum) , problem link :- https://mirror.codeforces.com/contest/1644/problem/C . i was getting TLE when i was using maps for hashing , but when i use vector for hashing for same code the solution got accepted . can anyone tell me why??

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

By _Untrackable_, history, 9 months ago, In English

Hi, everyone. I am getting TLE in test case 11 in Codeforces Round 888 (Div. 3) E (Nastya and Potions) . i have applied recursion to get solution for each potions. can i anyone tell me how can i fix this error??

sumbission link:- https://mirror.codeforces.com/contest/1851/submission/215759218

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it