OJ Board

1
3 3 1 2
2
1 2
2 1
AC output
Case 1: 1 0

How is the answer 1 0 for this case. If I understand the problem correctly, the knight will not be able to make a single move (because of the water) and hence it should be 0 0 right? Help appreciated.

You are using a map over a 1d array. In essence you are converting all O(1) into O(log n) and hence the extra cost.