Given the source point and the destination point of the path and two integers x and y. The task is to check whether it is possible to move from source to the destination with the below moves, If current position is (a, b) then the valid moves are:
- (a + x, b + y)
- (a – x, b + y)
- (a + x, b – y)
- (a – x, b – y)
Input: Sx = 0, Sy = 0, Dx = 0, Dy = 6, x = 2, y = 3
(0, 0) -> (2, 3) -> (0, 6)
Input: Sx = 1, Sy = 1, Dx = 3, Dy = 6, x = 1, y = 5
Approach: Let’s approach this problem as if the steps were (a, b) -> (a + x, 0) or (a, b) -> (a – x, 0) or (a, b) -> (0, b + y) or (a, b) -> (0, b – y). Then the answer is Yes if |Sx – Dx| mod x = 0 and |Sy – Dy| mod y = 0.
It’s easy to see that if the answer to this problem is NO then the answer to the original problem is also NO.
Let’s return to the original problem and take a look at some sequence of steps. It ends in some point (xe, ye). Define cntx as |xe – Sx| / x and cnty as |ye – Sy| / y . The parity of cntx is the same as the parity of cnty because every type of move changes the parity of both cntx and cnty.
So the answer is Yes if |Sx – Dx| mod x = 0, |Sy – Dy| mod y = 0 and |Sx – Dx| / x mod 2 = |Sy – Dy| / y mod 2.
Below is the implementation of the above approach.
- Shortest path from source to destination such that edge weights along path are alternatively increasing and decreasing
- Minimum cost path from source node to destination node via an intermediate node
- Minimum cells required to reach destination with jumps equal to cell values
- Multi Source Shortest Path in Unweighted Graph
- Maximum given sized rectangles that can be cut out of a sheet of paper
- Minimum number of cuts required to make circle segments equal sized
- Inplace (Fixed space) M x N size matrix transpose | Updated
- Number of decisions to reach destination
- Check if it is possible to move from (a, 0) to (b, 0) with given jumps
- Minimum Initial Points to Reach Destination
- Minimum number of jumps to reach end
- Count number of ways to reach destination in a Maze
- Count number of ways to reach destination in a Maze using BFS
- Count number of ways to reach destination in a maze
- Climb n-th stair with all jumps from 1 to n allowed (Three Different Approaches)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.