-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCOVID Spread
50 lines (49 loc) · 1.58 KB
/
COVID Spread
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
class Solution {
public:
bool issafe(int i, int j,int R,int C){
if (i >= 0 && i < R && j >= 0 && j < C)
return true;
return false;
}
int helpaterp(vector<vector<int>> v){
int R=v.size();
int C=v[0].size();
bool changed = false;
int no = 2;
while (true) {
for (int i = 0; i < R; i++) {
for (int j = 0; j < C; j++) {
if (v[i][j] == no) {
if (issafe(i + 1, j,R,C) && v[i + 1][j] == 1) {
v[i + 1][j] = v[i][j] + 1;
changed = true;
}
if (issafe(i, j + 1,R,C) && v[i][j + 1] == 1) {
v[i][j + 1] = v[i][j] + 1;
changed = true;
}
if (issafe(i - 1, j,R,C) && v[i - 1][j] == 1) {
v[i - 1][j] = v[i][j] + 1;
changed = true;
}
if (issafe(i, j - 1,R,C) && v[i][j - 1] == 1) {
v[i][j - 1] = v[i][j] + 1;
changed = true;
}
}
}
}
if (!changed)
break;
changed = false;
no++;
}
for (int i = 0; i < R; i++) {
for (int j = 0; j < C; j++) {
if (v[i][j] == 1)
return -1;
}
}
return no - 2;
}
};