-
Notifications
You must be signed in to change notification settings - Fork 0
/
Distance_of_nearest_cell_having_1.cpp
81 lines (73 loc) · 2.16 KB
/
Distance_of_nearest_cell_having_1.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution {
public:
// Function to find distance of nearest 1 in the grid for each cell.
vector<vector<int>> nearest(vector<vector<int>>& grid) {
int n = grid.size();
int m = grid[0].size();
int rdir[] = {-1, 0, +1, 0};
int cdir[] = {0, +1, 0, -1};
vector<vector<int>> vis(n, vector<int>(m, 0));
vector<vector<int>> dist(n, vector<int>(m, 0));
queue<pair<pair<int, int>, int>> q;
for(int row = 0; row < n; row++)
{
for(int col = 0; col < m; col++)
{
if(grid[row][col] == 1)
{
vis[row][col] = 1;
q.push({{row, col}, 0});
}
}
}
while(!q.empty())
{
int row = q.front().first.first;
int col = q.front().first.second;
int steps = q.front().second;
dist[row][col] = steps;
q.pop();
for(int i = 0; i < 4; i++)
{
int nrow = row + rdir[i];
int ncol = col + cdir[i];
if(nrow >= 0 && nrow < n && ncol >= 0 && ncol < m
&& vis[nrow][ncol] == 0)
{
vis[nrow][ncol] = 1;
q.push({{nrow, ncol}, steps+1});
}
}
}
return dist;
}
};
//{ Driver Code Starts.
int main() {
int tc;
cin >> tc;
while (tc--) {
int n, m;
cin >> n >> m;
vector<vector<int>> grid(n, vector<int>(m, -1));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> grid[i][j];
}
}
Solution obj;
vector<vector<int>> ans = obj.nearest(grid);
for (auto i : ans) {
for (auto j : i) {
cout << j << " ";
}
cout << "\n";
}
}
return 0;
}
// } Driver Code Ends