I_love_penny's blog

TLE in java solution [finding connected components]
By I_love_penny, history, 3 years ago, In English

Hello I wanted to know how can this java code can be improved. Currently it get TLE in few test cases.It would be helpful if someone can find the bottleneck in this solution.

Problem: https://cses.fi/problemset/task/1192
Solution: find the number of connected components.

code link: https://cses.fi/paste/b4d685acb261aaca26c573/

equivalent code in c++ is 10 times faster than java.

I am trying to switch to java for cp.

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

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

I think your code could benefit from the optimizations in this blog on optimizing deep recursion in Java Additionally, you could probably use BitSets instead of Boolean arrays as they tend to be faster as far as I know.

Thanks for sharing this problem. Please let me know(in messages maybe) If the above optomizations work.

→ Reply