Codeforces and Polygon may be unavailable from December 6, 19:00 (UTC) to December 6, 21:00 (UTC) due to technical maintenance. ×

jay__0208's blog

By jay__0208, history, 4 years ago, In English

Recently I gave Codeforces round #660 (Div 2) ============================================= ,

where i solved problem B in O(n) time complexity After doing the problem in O(n) I still get TLE !!! and its not only me I get to know many other also faced this problem

EVEN C++ O(n) SUBMISSION GOT TLE !!!!!

My submission : http://codeforces.net/contest/1388/submission/88472454

A C++ Submission : https://codeforces.net/contest/1388/submission/88470034

Full text and comments »

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