可以先将所有的炸雷和排雷火箭的信息存储到两个数组中。然后对于每一个排雷火箭,遍历炸雷数组,计算它与每个炸雷的距离是否小于等于炸雷的爆炸半径加上排雷火箭的爆炸半径。如果是,则将这颗炸雷的状态标记为"引爆"。最后,遍历炸雷数组,计算有多少颗炸雷的状态为"引爆"即可。
以下是Java代码示例:
``` import java.util.Scanner;
public class Main { static final int N = 1010; static int n, m; static boolean[] exploded = new boolean[N]; // 炸雷是否被引爆 static class Point { int x, y, r; // 坐标和半径 Point(int x, int y, int r) { this.x = x; this.y = y; this.r = r; } } static Point[] mines = new Point[N]; // 炸雷信息 static Point[] rockets = new Point[N]; // 排雷火箭信息
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
n = scanner.nextInt();
m = scanner.nextInt();
for (int i = 0; i < n; i++) {
int x = scanner.nextInt();
int y = scanner.nextInt();
int r = scanner.nextInt();
mines[i] = new Point(x, y, r);
}
for (int i = 0; i < m; i++) {
int x = scanner.nextInt();
int y = scanner.nextInt();
int r = scanner.nextInt();
rockets[i] = new Point(x, y, r);
}
// 遍历所有排雷火箭
for (int i = 0; i < m; i++) {
Point rocket = rockets[i];
// 遍历所有炸雷
for (int j = 0; j < n; j++) {
Point mine = mines[j];
if (!exploded