I have a solution which runs for not more than about 2 seconds on my machine even for a test where n = m = 9 and ALL rooms are bedrooms. I can't understand why it's TLE in here! I can't say that my machine is so good (I use MSVS 2005 under WinXP on a Sempron 2400 with 256MB RAM).

I can't find anywhere what are the characteristics of the judge server machine (except for the compiler), but somewhy I'm sure that they can't be so weak... And it seems that there can't be a test case worse than 81 bedrooms.

So what's wrong???

Well a couple of minutes after the post got it accepted... :)))
Strange things...

I optimized my solution just a very little bit (runs faster for just some milliseconds in the worst case). Still on my machine it runs for 2 seconds (exactly) while here it gives 3.812.

But wait... I have an idea! :)
I guess that the time is measured for ALL test cases together, right? :)

A shame I didn't realize that earlier! :-[ :)

But still it would be very interesting to know what are the characteristics of the judge server machine (for the future :)).

Edited by author 08.09.2008 02:37

You are wrong. Time is measured for each test separately. I think the problem is in different compiler. Try to compile it with Intel C++ compiler on your machine