链接
题目
思路
每个圆只会被它后面的圆盘覆盖,然后对于每个圆求一下覆盖的圆弧的角度,最后让 2 ∗ π − a n g l e 2*\pi - angle 2∗π−angle即可;
对于角度的计算,我们只需要算出
∠
B
A
C
\angle BAC
∠BAC 和
∠
B
A
D
\angle BAD
∠BAD 即可,然后算出覆盖的圆弧的角度范围
l
=
∠
B
A
D
−
∠
B
A
C
l = \angle BAD - \angle BAC
l=∠BAD−∠BAC,
r
=
∠
B
A
D
+
∠
B
A
C
r = \angle BAD + \angle BAC
r=∠BAD+∠BAC,然后对所有的角度范围取一个并集即可;
对于算角度范围时有几个注意点:
- l < 0 l<0 l<0 && r < 0 r<0 r<0 需要给 l , r l,r l,r 都加上 2 π 2\pi 2π,再插入到角范围集合;
- l < 0 l < 0 l<0 时,插入到角范围集合的时候,需要插入 ( l + 2 π , 2 π ) (l + 2\pi,2\pi) (l+2π,2π) 和 ( 0 , r ) (0 , r) (0,r);
- r > 2 π r > 2\pi r>2π 时,需要插入 ( l , 2 π ) (l,2 \pi) (l,2π) 和 ( 0 , r − 2 π ) (0 , r-2\pi) (0,r−2π);
AC代码
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <map>
#include <vector>
#include <queue>
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair <int,int> PII;
const int N = 1010;
const ll mod = 998244353;
const double pi = 3.1415926535897932;
int n, k;
struct Circle{
double x, y;
double r;
} c[N];
bool flag;
struct angle {
double l, r;
bool operator < (const angle&W) const{
return l < W.l;
}
}ang[2 * N];
void insert(double l, double r) {
ang[k].l = l;
ang[k ++].r = r;
}
void get_l_r(Circle a, Circle b) {
double dist = sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
if (dist >= a.r + b.r || b.r + dist <= a.r) return ;
if (dist + a.r <= b.r) {
flag = true;
return ;
}
double angle1 = acos((a.r * a.r + dist * dist - b.r * b.r) / (2 * a.r * dist));
double angle2 = atan2(b.y - a.y, b.x - a.x);
double l = angle2 - angle1;
double r = angle2 + angle1;
if (l < 0 && r < 0) {
l += 2 * pi;
r += 2 * pi;
}
if (l >= 0 && r <= 2 * pi) insert(l, r);
else {
if (l < 0) {
insert(l + 2 * pi, 2 * pi);
insert(0, r);
}
else {
insert(l, 2 * pi);
insert(0, r - pi * 2);
}
}
}
double get_angle(){
double res = 0;
sort(ang, ang + k);
double lmin = ang[0].l;
for (int i = 0; i < k; i ++) {
if (lmin >= ang[i].r) continue;
if (ang[i].l > lmin) res += ang[i].r - ang[i].l;
else res += ang[i].r - lmin;
lmin = ang[i].r;
}
return 2 * pi - res;
}
int main()
{
cin >> n;
double ans = 0;
for (int i = 1; i <= n; i ++) cin >> c[i].r >> c[i].x >> c[i].y;
for (int i = 1; i <= n; i ++) {
flag = false, k = 0;
for (int j = i + 1; j <= n; j ++) {
get_l_r(c[i], c[j]);
if (flag) break;
}
if (!flag) ans += get_angle() * c[i].r;
}
printf("%.3lf\n", ans);
return 0;
}