Tap here to switch tabs
Problem
Submissions

Problem: Shortest Distance from All Buildings

Shortest Distance from All Buildings asks you to choose empty land in a grid so total shortest four-way travel to every building is minimized, avoiding obstacles, or report no valid placement.

Statement

Given an m x n integer grid grid, where each cell contains one of three values:

  • 00 represents empty land that can be freely traversed,

  • 11 represents a building that cannot be passed through,

  • 22 represents an obstacle that cannot be passed through.

You want to place a house on an empty land cell (00) such that the sum of shortest distances from the house to all buildings is minimized. Movement is restricted to four directions: up, down, left, and right.

Return the minimum total travel distance for such a placement. If no valid empty land cell can reach all buildings, return −1-1.

Note: The total travel distance is the sum of the shortest path distances from the chosen empty land cell to every building in the grid.

Constraints:

  • m == grid.length

  • n == grid[i].length

  • 1≤1 \leq m, n ≤50\leq 50

  • grid[i][j] is either 00, 11, or 22

  • There will be at least 11 building in grid

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Shortest Distance from All Buildings

Shortest Distance from All Buildings asks you to choose empty land in a grid so total shortest four-way travel to every building is minimized, avoiding obstacles, or report no valid placement.

Statement

Given an m x n integer grid grid, where each cell contains one of three values:

  • 00 represents empty land that can be freely traversed,

  • 11 represents a building that cannot be passed through,

  • 22 represents an obstacle that cannot be passed through.

You want to place a house on an empty land cell (00) such that the sum of shortest distances from the house to all buildings is minimized. Movement is restricted to four directions: up, down, left, and right.

Return the minimum total travel distance for such a placement. If no valid empty land cell can reach all buildings, return −1-1.

Note: The total travel distance is the sum of the shortest path distances from the chosen empty land cell to every building in the grid.

Constraints:

  • m == grid.length

  • n == grid[i].length

  • 1≤1 \leq m, n ≤50\leq 50

  • grid[i][j] is either 00, 11, or 22

  • There will be at least 11 building in grid