OJ Board

That doesn't answer the question, though. If you have to reinvent data structures that are already in the language, you're not focusing on the right part of the problem.

Hi, I'm trying to do the Pick up sticks problem and wonder if it's possible to do in Java with normal data structures. Just using one ArrayList for each node already gives me a TLE. Any suggestions?

Yeah, StringBuffer did the trick. But I feel the time limit is still too close. The largest problem seems to be that formatting strings in Java is quite slow, and there is no easy way of achieving the same combination of rounding and number of decimals as String.format(). It would be more ideal if ...

Is this even possible to do in Java? I just get TLE:

Here's 1 more tricky test case, where the correct output is 1 even though there's already a fire station there. So don't immediately reject any intersection that already has a fire station. Be careful on TLE though, because after making this change my code went from 1sec to 6sec.

1
1 2
1
1 2 0 ...

Same problem here - submission is stuck in queue.

When I click on a problem ID in either the "My Submissions" page or "My statistics page", I get a "You are not authorised to view this resource." error message. The problem seems to be that URLs from those pages are of the form

http://icpcres.ecs.baylor.edu/onlinejudge/index.php?option=com ...