11852 - Knight's Trip

[Nursoltan_h]

Hi,
Any Hints How to solve this problem?

http://uva.onlinejudge.org/contests/263 ... 11852.html

Thanks in Advance

[Angeh]

A Pure Greedy algorithm will solve it ...
generate the output for a Board n*n and by induction find the solution to (n+1)*(n+1)
the minimum number of moves are at least the (x+1)/2 , and also at least (y+1)/2 since you can more at most 2 row or column each time ... and the total of 3 cells each time .... so the number of moves is also at least (x+y+2) /3 ....
we suppose that cell 0,0 is colored white ...
so if the target cell is also white we need even number of moves ...
else if target cell is black we need odd number of moves ...
there are 4 cells in the Board that dont use the Principle mentioned above and you need to check this cases ...
now its easy to find the solution ...

you can find usefull hints for this kind of Problems in Algorithmic problem solving book .......

[Nursoltan_h]

Thank you very much.

[jurong]

Thanks for your help.
But can you tell me where to download "Algorithmic problem solving book"?
I looked at google but cannot find.
Thank you again.

[Igor9669]

You could find it here: http://uvatoolkit.com/material.php

[jurong]

Thanks Igor9669.
Following your link I found this course by the author but I cannot download the book (maybe this link is not avaiable).
If you have this book, can you sent to me via my email : doulce2000@yahoo.com.
Thanks you much!

[Angeh]

sent

[sir. manuel]

i search it in the internet but i can´t find it!!!, so please can you send it to my email????....kavic1@hotmail.com


Thanks