Skip to content

Latest commit

 

History

History
85 lines (70 loc) · 3.25 KB

README.md

File metadata and controls

85 lines (70 loc) · 3.25 KB

2503. Maximum Number of Points From Grid Queries

You are given an m x n integer matrix grid and an array queries of size k.

Find an array answer of size k such that for each integer queries[i] you start in the top left cell of the matrix and repeat the following process:

  • If queries[i] is strictly greater than the value of the current cell that you are in, then you get one point if it is your first time visiting this cell, and you can move to any adjacent cell in all 4 directions: up, down, left, and right.
  • Otherwise, you do not get any points, and you end this process.

After the process, answer[i] is the maximum number of points you can get. Note that for each query you are allowed to visit the same cell multiple times.

Return the resulting array answer.

Example 1:

Input: grid = [[1,2,3],[2,5,7],[3,5,1]], queries = [5,6,2]
Output: [5,8,1]
Explanation: The diagrams above show which cells we visit to get points for each query.

Example 2:

Input: grid = [[5,2,1],[1,1,2]], queries = [3]
Output: [0]
Explanation: We can not get any points because the value of the top left cell is already greater than or equal to 3.

Constraints:

  • m == grid.length
  • n == grid[i].length
  • 2 <= m, n <= 1000
  • 4 <= m * n <= 105
  • k == queries.length
  • 1 <= k <= 104
  • 1 <= grid[i][j], queries[i] <= 106

Solutions (Rust)

1. Solution

impl Solution {
    pub fn max_points(grid: Vec<Vec<i32>>, queries: Vec<i32>) -> Vec<i32> {
        use std::collections::BinaryHeap;
        use std::collections::HashSet;

        let (m, n) = (grid.len(), grid[0].len());
        let mut heap = BinaryHeap::from([(-grid[0][0], 0, 0)]);
        let mut visited = HashSet::from([(0, 0)]);
        let mut indices = (0..queries.len()).collect::<Vec<_>>();
        let mut points = 0;
        let mut answer = vec![0; queries.len()];

        indices.sort_unstable_by_key(|&i| queries[i]);

        for &i in &indices {
            while queries[i] > -heap.peek().unwrap_or(&(-1000000, 0, 0)).0 {
                let (_, i, j) = heap.pop().unwrap();

                if i > 0 && !visited.contains(&(i - 1, j)) {
                    heap.push((-grid[i - 1][j], i - 1, j));
                    visited.insert((i - 1, j));
                }
                if i < m - 1 && !visited.contains(&(i + 1, j)) {
                    heap.push((-grid[i + 1][j], i + 1, j));
                    visited.insert((i + 1, j));
                }
                if j > 0 && !visited.contains(&(i, j - 1)) {
                    heap.push((-grid[i][j - 1], i, j - 1));
                    visited.insert((i, j - 1));
                }
                if j < n - 1 && !visited.contains(&(i, j + 1)) {
                    heap.push((-grid[i][j + 1], i, j + 1));
                    visited.insert((i, j + 1));
                }

                points += 1;
            }

            answer[i] = points;
        }

        answer
    }
}