Codeforces and Polygon may be unavailable from May 23, 4:00 (UTC) to May 23, 8:00 (UTC) due to technical maintenance. ×

i_m_Shakil's blog

By i_m_Shakil, history, 4 years ago, In English

Problem Link: 231C - Прибавляй не прибавляй

These are my two submissions:

Both of these solutions are written using the same logic & run time is O(n log n). Why is Python getting TLE?

N.B: I'm new in python.

Thanks in Advance.

  • Vote: I like it
  • +3
  • Vote: I do not like it

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

My Code Have a look at this (look inside the main function, everything else is a part of the template). First I sort the array and then used two pointer technique over it and got the AC

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

This is your code I just put your code inside my template and submit using PyPy2 and look got AC in 872ms. If you are using python, try to use PyPy2 it's much faster compared to Python2, Python3 and PyPy3 as mentioned by pajenegod many times