Coding - Maximum Number of Points from Grid Queries

Problem Statement

You are given an integer matrix grid and an array queries. Starting from the top-left cell, you may move in four directions (up, down, left, or right) from a cell if it is within the grid. For each query value q, count how many cells can be reached using only cells whose value is strictly less than q. Return the answers in the original query order.

Examples

Example 1: Input: grid = [[1,2],[3,4]], queries = [1] Output: [1] Explanation: From the top-left cell, we can reach 1 cell with value 1.

Example 2: ` Input: grid = [[5,7,5],[7,11,3],[5,3,9]], queries = [11,9,5] Output: [2,2,6] Explanation:

• For query = 11, we can reach 2 cells with values 5 and 3.
• For query = 9, we can reach 2 cells with values 5 and 3.
• For query = 5, we can reach 6 cells with values 5, 3, 5, 7, 7, and 3. `

Constraints

• 1 <= grid.length <= 105
• 1 <= grid[0].length <= 105
• 1 <= grid[i][j] <= 105
• 1 <= queries.length <= 105
• 0 <= queries[i] < 105

Hints

1. This problem can be solved using a sweep line algorithm.
2. You can also solve this problem using a segment tree or a Fenwick tree (also known as a binary indexed tree).