CCF 202009-4 星际旅行

#include <bits/stdc++.h>
#define ll long long
#define _for(i, a, b) for (ll i = (a); i < (b); ++i)
#define sc scanf
#define pr printf
#define TLE                      \
    ios::sync_with_stdio(false); \
    cin.tie(0);
const int maxn = 1e5 + 5;
const int INF = 0x3f3f3f3f;
using namespace std;

int n, m;
double O[105], r;
double P[2005][105];
double dis[2005]; //与原点O的距离
double temp;
double res[2005][2005] = {0};
double tangent[2005] = {0}; //切线长度

int main()
{
    cin >> n >> m >> r;
    _for(i, 1, n + 1)
    {
        cin >> O[i];
    }
    _for(i, 1, m + 1)
    {
        _for(j, 1, n + 1)
        {
            cin >> P[i][j];
        }
    }
    _for(i, 1, m + 1)
    {
        temp = 0.0;
        _for(j, 1, n + 1)
        {
            temp += (P[i][j] - O[j]) * (P[i][j] - O[j]);
        }
        dis[i] = sqrt(temp);
        tangent[i] = sqrt(dis[i] * dis[i] - r * r);
    }
    _for(i, 1, m + 1)
    {
        _for(j, i + 1, m + 1)
        {
            temp = 0.0;
            _for(k, 1, n + 1)
            {
                temp += (P[i][k] - P[j][k]) * (P[i][k] - P[j][k]);
            }
            double _dis = sqrt(temp); //i-j 两点间直线距离
            double p = (dis[i] + dis[j] + _dis) / 2;
            double S = sqrt(p * (p - _dis) * (p - dis[i]) * (p - dis[j]));
            double h = 2 * S / _dis; //i-j两点连线与O的直线距离
            if (h >= r ||
                _dis * _dis + dis[i] * dis[i] <= dis[j] * dis[j] ||
                _dis * _dis + dis[j] * dis[j] <= dis[i] * dis[i])
            {
                res[i][j] = res[j][i] = _dis;
                continue;
            }
            double Caob = acos((dis[i] * dis[i] + dis[j] * dis[j] - _dis * _dis) / (2 * dis[i] * dis[j]));
            double Coa = acos(r / dis[i]);
            double Cob = acos(r / dis[j]);
            res[i][j] = res[j][i] = (Caob - Coa - Cob) * r + tangent[i] + tangent[j];
        }
    }
    _for(i, 1, m + 1)
    {
        double sum = 0;
        _for(j, 1, m + 1)
        {
            if (i != j)
            {
                sum += res[i][j];
            }
        }
        pr("%.14f\n", sum);
    }
    return 0;
}