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

Peace_789's blog

By Peace_789, history, 5 years ago, In English

Hey there ...

Today I was solving these problem click ... and I got tle verdict on TC 5. Here's a link to my solution click.

As much as I got , time complexity of my above solution is O(nlogn) where n can be upto 10^5.

So , I am not getting why it is giving tle verdict. So any help regarding this would be appreciated.

Thanks in advance ;)

UPD ==================: Was getting TLE due to ( endl ).

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

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

I would like to suggest to reserve memory for the vector before filling it and recast output operations cout<<1<<" "<<x<<" "<<"R"<<endl; with cout << "1 " << x << " R\n";.

»
5 years ago, # |
  Vote: I like it +5 Vote: I do not like it

Use '\n' instead of endl. endl flushes the output and hence consumes more time. I modified your code and now it gives WA at test 5 and it is nowhere near to the TL.