This approach involves using Breadth-First Search (BFS) to precompute the minimum Manhattan distance from each cell to any thief in the grid, and then using this information to find the maximum safeness factor for reaching the bottom-right corner.
Time Complexity: O(n2 log n), where n is the grid size, due to the Dijkstra-like process.
Space Complexity: O(n2) for storing distances and safeness factors.
1import java.util.*;
2
3public class SafestPathFinder {
4 private static final int[][] directions = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
5
6 public int maxSafenessFactor(int[][] grid) {
7 int n = grid.length;
8 int[][] distance = new int[n][n];
9 for (int[] row : distance) Arrays.fill(row, Integer.MAX_VALUE);
10 Queue<int[]> queue = new LinkedList<>();
11
12 // BFS to calculate distance to the nearest thief
13 for (int r = 0; r < n; r++) {
14 for (int c = 0; c < n; c++) {
15 if (grid[r][c] == 1) {
16 queue.offer(new int[]{r, c});
17 distance[r][c] = 0;
18 }
19 }
20 }
21
22 while (!queue.isEmpty()) {
23 int[] pos = queue.poll();
24 int r = pos[0], c = pos[1];
25 for (int[] dir : directions) {
26 int nr = r + dir[0], nc = c + dir[1];
27 if (nr >= 0 && nr < n && nc >= 0 && nc < n && distance[nr][nc] == Integer.MAX_VALUE) {
28 distance[nr][nc] = distance[r][c] + 1;
29 queue.offer(new int[]{nr, nc});
30 }
31 }
32 }
33
34 // Max-heap-like Dijkstra's for the safest path
35 PriorityQueue<int[]> pq = new PriorityQueue<>((a, b) -> b[2] - a[2]); // Max-heap based on safeness factor
36 pq.offer(new int[]{0, 0, distance[0][0]});
37 boolean[][] visited = new boolean[n][n];
38
39 while (!pq.isEmpty()) {
40 int[] cur = pq.poll();
41 int r = cur[0], c = cur[1], safeness = cur[2];
42
43 if (r == n - 1 && c == n - 1) return safeness;
44 visited[r][c] = true;
45
46 for (int[] dir : directions) {
47 int nr = r + dir[0], nc = c + dir[1];
48 if (nr >= 0 && nr < n && nc >= 0 && nc < n && !visited[nr][nc]) {
49 int newSafeness = Math.min(safeness, distance[nr][nc]);
50 pq.offer(new int[]{nr, nc, newSafeness});
51 }
52 }
53 }
54
55 return 0;
56 }
57
58 public static void main(String[] args) {
59 SafestPathFinder spf = new SafestPathFinder();
60 int[][] grid = {{0, 0, 1}, {0, 0, 0}, {0, 0, 0}};
61 System.out.println(spf.maxSafenessFactor(grid)); // Output: 2
62 }
63}
64The Java implementation uses BFS to compute how far each cell is from the closest thief, followed by priority-based processing to ensure optimal safeness to the target using Dijkstra's inspired strategy.
This approach considers processing from both the starting and ending points in a bidirectional BFS style, potentially meeting in the middle for optimized distance calculations and safeness factor determination.
Time Complexity: O(n2) due to simultaneous BFS processing.
Space Complexity: O(n2) as distances from both ends are computed.
1using System;
2using System.Collections.Generic;
3
4public class SafestPathFinder {
5 private static int[][] directions = new int[4][] {
6 new int[] { 0, 1 },
7 new int[] { 1, 0 },
8 new int[] { 0, -1 },
9 new int[] { -1, 0 }
10 };
11
12 public int BidirectionalSafenessFactor(int[][] grid) {
13 int n = grid.Length;
14 int[][] distFromStart = new int[n][];
15 int[][] distFromEnd = new int[n][];
16 for (int i = 0; i < n; i++) {
17 distFromStart[i] = new int[n];
18 distFromEnd[i] = new int[n];
19 Array.Fill(distFromStart[i], int.MaxValue);
20 Array.Fill(distFromEnd[i], int.MaxValue);
21 }
22
23 Queue<(int, int)> startQueue = new();
24 startQueue.Enqueue((0, 0));
25 distFromStart[0][0] = 0;
26
27 Queue<(int, int)> endQueue = new();
28 endQueue.Enqueue((n - 1, n - 1));
29 distFromEnd[n - 1][n - 1] = 0;
30
31 while (startQueue.Count > 0 || endQueue.Count > 0) {
32 if (startQueue.Count > 0) {
33 var (r, c) = startQueue.Dequeue();
34 foreach (var dir in directions) {
35 int nr = r + dir[0];
36 int nc = c + dir[1];
37 if (nr >= 0 && nr < n && nc >= 0 && nc < n && distFromStart[nr][nc] == int.MaxValue) {
38 distFromStart[nr][nc] = distFromStart[r][c] + 1;
39 startQueue.Enqueue((nr, nc));
40 }
41 }
42 }
43
44 if (endQueue.Count > 0) {
45 var (r, c) = endQueue.Dequeue();
46 foreach (var dir in directions) {
47 int nr = r + dir[0];
48 int nc = c + dir[1];
49 if (nr >= 0 && nr < n && nc >= 0 && nc < n && distFromEnd[nr][nc] == int.MaxValue) {
50 distFromEnd[nr][nc] = distFromEnd[r][c] + 1;
51 endQueue.Enqueue((nr, nc));
52 }
53 }
54 }
55
56 // Check overlapping
57data switching
58 for (int i = 0; i < n; ++i) {
59 for (int j = 0; j < n; ++j) {
60 if (distFromStart[i][j] != int.MaxValue && distFromEnd[i][j] != int.MaxValue) {
61 return distFromStart[i][j] + distFromEnd[i][j];
62 }
63 }
64 }
65 }
66
67 return -1;
68 }
69
70 public static void Main() {
71 SafestPathFinder spf = new();
72 int[][] grid = new int[][] {
73 new int[] { 0, 0, 1 },
74 new int[] { 0, 0, 0 },
75 new int[] { 0, 0, 0 }
76 };
77 Console.WriteLine(spf.BidirectionalSafenessFactor(grid)); // Output: Safeness factor
78 }
79}
80The C# method leverages bidirectional BFS to concurrently expand from both initial and final cell locations until intersection occurs. It's highly efficient in discovering paths by reducing each direction BFS depth.