BOMBING - TLE using BIT

I am trying problem [BOMBING][1] using java but getting TLE. My approach is as follows:-

  1. store all queries first

  2. compress all room nos using a treemap

  3. process the queries. Perform point update, range query BIT operations using the compressed value of nos.

Here’s my code - [link][2]

So i wanted to know whether my approach and code is correct. If yes how can i optimise it?
[1]: http://www.codechef.com/problems/BOMBING
[2]: http://www.codechef.com/viewsolution/1942265

//