Escape The Ghosts Problem
Description
LeetCode Problem 789.
You are playing a simplified PAC-MAN game on an infinite 2-D grid. You start at the point [0, 0], and you are given a destination point target = [x_target, y_target] that you are trying to get to. There are several ghosts on the map with their starting positions given as a 2D array ghosts, where ghosts[i] = [x_i, y_i] represents the starting position of the i^th ghost. All inputs are integral coordinates.
Each turn, you and all the ghosts may independently choose to either move 1 unit in any of the four cardinal directions: north, east, south, or west, or stay still. All actions happen simultaneously.
You escape if and only if you can reach the target before any ghost reaches you. If you reach any square (including the target) at the same time as a ghost, it does not count as an escape.
Return true if it is possible to escape regardless of how the ghosts move, otherwise return false.
Example 1:
1
2
3
Input: ghosts = [[1,0],[0,3]], target = [0,1]
Output: true
Explanation: You can reach the destination (0, 1) after 1 turn, while the ghosts located at (1, 0) and (0, 3) cannot catch up with you.
Example 2:
1
2
3
Input: ghosts = [[1,0]], target = [2,0]
Output: false
Explanation: You need to reach the destination (2, 0), but the ghost at (1, 0) lies between you and the destination.
Example 3:
1
2
3
Input: ghosts = [[2,0]], target = [1,0]
Output: false
Explanation: The ghost can reach the target at the same time as you.
Example 4:
1
2
Input: ghosts = [[5,0],[-10,-2],[0,-5],[-2,-2],[-7,1]], target = [7,7]
Output: false
Example 5:
1
2
Input: ghosts = [[-1,0],[0,1],[-1,0],[0,1],[-1,0]], target = [0,0]
Output: true
Constraints:
- 1 <= ghosts.length <= 100
- ghosts[i].length == 2
- -10^4 <= x_i, y_i <= 10^4
- There can be multiple ghosts in the same location.
- target.length == 2
- -10^4 <= x_target, y_target <= 10^4
Sample C++ Code
1
2
3
4
5
6
7
8
9
10
11
12
class Solution {
public:
bool escapeGhosts(vector<vector<int>>& a, vector<int>& k) {
int n = a.size(), pacman = abs(k[0]) + abs(k[1]);
for (int i = 0; i < n; ++i) {
int ghost = abs(k[0] - a[i][0]) + abs(k[1] - a[i][1]);
if (ghost <= pacman)
return false;
}
return true;
}
};