Q1:灌溉
思路:
我们这里创建两个map[n+2][m+2]这样我们在灌溉的时候不会出现数组下标越界的情况了,我们这里核心就是创建两个map,一个是上一分钟,灌溉的地方,我们遍历map2,看一下哪一个被灌溉了,这个时候我们把map1的灌溉状态改变一下,最后的时候把map1中的拷贝给map2即可,暴力就完事了
代码:
import java.util.Scanner;
public class Question1 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int[][] map1 = new int[n + 2][m + 2];
int[][] map2 = new int[n + 2][m + 2];
int t = sc.nextInt();
for (int i = 0; i < t; i++) {
int r = sc.nextInt();
int c = sc.nextInt();
map1[r][c] = 1;
map2[r][c] = 1;
}
int k = sc.nextInt();
for (int x = 0; x < k; x++) { //第k分钟就是灌溉几次,
//遍历map1
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (map2[i][j] == 1) {
map1[i - 1][j] = 1; //左边
map1[i + 1][j] = 1; //右边
map1[i][j - 1] = 1; //上边
map1[i][j + 1] = 1; //下边
}
}
}
map2 = map1.clone();
}
//统计多少个格子上面是true
int ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (map2[i][j] == 1) {
ans++;
}
}
}
System.out.println(ans);
}
}