big_boy_coder's blog

By big_boy_coder, history, 3 months ago, In English

For a few of the CSES Sorting and Searching problems, such as Apartments, Concert Tickets, and Traffic Lights, and Movie Festival 2, I can't avoid TLE on the largest testcases in java.

Here is code for Movie Festival 2, https://ideone.com/AKdglG

I am using bufferedreader already, but CSES time limit seems to strict. Any tips? Or should I accept my fate as a java user and not care since CF and other platforms don't have 1sec limits?

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

»
3 months ago, # |
  Vote: I like it +1 Vote: I do not like it

I have had the same fate as you. In many of the CSES problems the simple streamReader IO is not enough, you will need to implement buffered reading yourself, I used the 4th code from here https://www.geeksforgeeks.org/fast-io-in-java-in-competitive-programming/ , that has so far gotten most codes ac'ed in CSES for me.

Also to people downvoting, I don't see any reason this question should be downvoted. If you think it's a copy of an old question, the minimum you could do before downvoting is post a link to an old question, no?

»
2 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I used PriorityQueue for 'Apartments' problem. It worked

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Having the same issue here, hopefully pllk can make a change for this.

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

I've avoided some TLEs by taking out the multiple print statementsand appending to a StringBuilder instead. Then I print just once at the very end.