Help, problem D. Tree Construction.

Revision en1, by moaz123, 2016-06-22 22:37:36

Hey everyone, how are you?

I am getting Time limit in this problem with a complexity of O(n log n) n<=10^5. I tried to see if something is overlapping, but couldn't find any. Thanks everyone.

And sorry for my bad English.

submission link: http://mirror.codeforces.com/contest/675/submission/18651358. Organized code Link: https://codeshare.io/leZMR

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English moaz123 2016-06-22 22:37:36 393 Initial revision (published)