OJ Board

Larry wrote:Seems like most of the memo's got around 1 second. Just memo on the state..

I got AC in 0.023 using memoization thx...

is it that ppl who solved it in less than 1s or .002 sec have solved it using backtracking..
I myself solve it using dp... more apt would be memoization... :lol:

I takes >1s ,precisely 1.094..
:wink:

I tried it using back-tracking, and DP like O(2^n), but I got TLE :(

I want to show your ...

Moha wrote:Think about it with Floyd or Bellmanford.

Huh, Really? I wonder why the problem is to find shortest path...

I can't approach to this problem.

Plz someone help me...

To find how many solution in inputs, it maybe works O(|blanks|^9)

This is quite obviously false. In fact, finding the exact count of sudoku boards was quite a difficult problem and solving it took the mathematical community quite a while. As far as I know, there's still no known closed form ...

I solved it by BackTracking...

To find how many solution in inputs, it maybe works O(|blanks|^9)