#include <iostream>
#include <cmath>
using namespace std;

int main() {
    int m;
    cin >> m;
    
    int x[100005], y[100005], r[100005];
    for (int i = 0; i < m; i++) {
        cin >> x[i] >> y[i] >> r[i];
    }
    
    int px[10], py[10];
    for (int i = 0; i < 10; i++) {
        cin >> px[i] >> py[i];
    }
    
    int quality[100005][100005] = {0};
    
    for (int i = 0; i < m; i++) {
        for (int j = -100000; j <= 100000; j++) {
            for (int k = -100000; k <= 100000; k++) {
                if (pow(j - x[i], 2) + pow(k - y[i], 2) < pow(r[i], 2)) {
                    quality[j + 100000][k + 100000]++;
                }
            }
        }
    }
    
    double sum = 0;
    for (int i = 0; i < 10; i++) {
        sum += quality[px[i] + 100000][py[i] + 100000] + 1; // 初始品质为 1
    }
    
    printf("%.2lf", sum / 10);
    return 0;
}

原文地址: https://www.cveoy.top/t/topic/jCXB 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录