lkmcfj's blog

By lkmcfj, history, 3 years ago, In English,

My code got TLE9(n=m=1e6,k=2e6) on 767D - Кефир.24775880 the complexity is O(n+m)

In custom test,when I replaced the input part with random(the input file was too large),the program took 1763ms.When I deleted the output part,it turned out to be 31ms.Most of the time is spent on I/O.

So is there any trick to make I/O faster in pascal(just like what we use in c++),or this problem is impossible to solve in pascal?

//sorry for my poor English

Read more »

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