Wow =)

AC in 1.0 sec =)

Into memories :)

PS: If somebody (maybe authors?) can give me better solution, please, do it. I want to see these 0.375 and 0.437 very very much.

Re: Wow =)

I think you should use Dynamic Programming to solve this problem... like the "Betsy's Tour" if N > 9 ....

Re: Wow =)

how did you solve this problem by DP

can you give a recursive formula

Re: Wow =)

how do you solve this problem

Re: Wow =)

May you tell me How many testdata are there in this problem..

I got TLE on test18 and exceeded 0.046sec

Re: Wow =)

My solution is DP, and it also TLs at 18th test. If I manage to optimize it, I'll tell you how :)

Re: Wow =)

Test 18 is empty 12x12 grid. But... there is test 19 =(((

Re: Wow =)

HAHA, AC in 1 second too :))))))))))))))

Still, 18th test is precalculated (detector of empty 12x12 grid).

*Edited by author 20.07.2008 13:15*

Re: Wow =)

Posted by

Saatgut 14 Oct 2008 10:57

WA #TEST18, then I precalculate the empty grid with 12X12, and pass it..

But continuely, WA #TEST19..

Why?