Canadian Computing Competition: 2010 Stage 1, Junior #5
Below is an chessboard on which we will designate square locations using the ordered pairs as indicated. For example, notice that piece is at position and piece is at position .
A knight is a special game piece that can leap over other pieces, moving in the "L" pattern. Specifically, in the diagram below, represents the knight's starting position and the numbers 1 through 8 represent possible places the knight may move to.
Your program will read the starting location of the knight and output the smallest number of jumps or moves needed to arrive at a location specified in the second input.
Your program will read four integers, where each integer is in the range . The first two integers represent the starting position of the knight. The second two integers represent the final position of the knight.
Your program should output the minimum (non-negative integer) number of moves required to move the knight from the starting position to the final position. Note that the knight is not allowed to move off the board during the sequence of moves.
Sample Input 1
2 1 3 3
Output for Sample Input 1
Sample Input 2
4 2 7 5
Output for Sample Input 2
Help guys. What I have to learn to solve this problem? I think I don't have the bases to solve it.
This problem is solvable by BFS, DFS(Not sure), or others.
The problem type is graph theory. So... I guess you need to learn graph theory.
Or you can brute force it.
A chess knight will take at most 5 moves to reach a given square. I don't know if that bit of chess knowledge can be helpful for this problem.
My brain after reading this: to lazy too implement resursion copy-pastes the same code 6 times >_<
Good to know I won't need to make a recursion that loops like 50 times without TLE.
It's actually 6 in some cases, such as from corner to corner.
Ah right, it is 6 moves. Sorry.
This comment is hidden due to too much negative feedback. Show it anyway.
I was thinking you could pass the problem by setting an exit condition on recursion to be 5, instead of using a visited cache which is what I assume the problem intended.
pair<int,int>: https://dmoj.ca/submission/2145895 still MLE's.
Edit: For comment below.
I believe I did the same thing and my program passed without MLEing. I'm not sure why yours did not pass :(. https://dmoj.ca/src/3693845
If there was no memory limit their code would of TLE instead of MLE on test case #6 because of an infinite loop. See Jonathan's comment down below.
One mb ://
I mle by one mb on case 6 :(. Any optimization tips?
instead of making separate queues per dimension try using pairs to reduce the number of possible queue entries.
A queue of pair<int,int> still mle's. Maybe my BFS algorithm is inefficient? Best solutions only use like 1-2 mb.
Your program enters an infinite loop for the test case:
Thanks! I got it now!
Then it is most likely that you have a logical error/edge case you did not account for. The runtime for that case took abnormally long as well. I would advise you to look over the semantics.
You were right, I had
if (visited.at(new_h).at(new_v) == 0)instead of
if (visited.at(new_v).at(new_h) == 0).
Edit: edits were glitching idk why
Did the point total for this question decrease?? I recall this being worth 10 points.
Yes, the points rewarded for this problems was reduced from 10 points to 7 points to match the other classical graph theory problems.
What does IR mean and why do i get it when i submit
It means you got an
Refer to https://dmoj.ca/about/codes/
wleung_bvg you're getting it too?
Your code has variables that have indeterminate ("random") values. This can sometimes happen when declaring a variable in a non global scope without initializing it with a value. Simply initializing the boolean variable with the value
falsein your spot struct will allow your code to pass.
Ah,thanks. Why does the first case work though?