这是一道关于计算在无限xy平面上，n个舞者的圆形活动范围中，奇数个活动范围覆盖区域面积之和最大化的题目。每个舞者的活动范围是一个圆，且任意两个范围要么完全相离要么一个包含另一个。问题要求找到两个时间段（午夜前和午夜后），使得这两个时间段内舞者活动范围覆盖的奇数区域之和最大。输入包含舞者的位置和半径信息，输出最大可能的总宽敞度，答案需满足一定的精度要求。
The crowdedness of the discotheque would never stop our friends from having fun, but a bit more spaciousness won’t hurt, will it?
The discotheque can be seen as an infinite xy-plane, in which there are a total of n dancers. Once someone starts moving around, they will move only inside their own movement range, which is a circular area Ci described by a center (xi, yi) and a radius ri. No two ranges’ borders have more than one common point, that is for every pair (i, j) (1 ≤ i < j ≤ n) either ranges Ci and Cj are disjoint, or one of them is a subset of the other. Note that it’s possible that two ranges’ borders share a single common point, but no two dancers have exactly the same ranges.
Tsukihi, being one of them, defines the spaciousness to be the area covered by an odd number of movement ranges of dancers who are moving. An example is shown below, with shaded regions representing the spaciousness if everyone moves at the same time.
But no one keeps moving for the whole night after all, so the whole night’s time is divided into two halves — before midnight and after midnight. Every dancer moves around in one half, while sitting down with friends in the other. The spaciousness of two halves are calculated separately and their sum should, of course, be as large as possible. The following figure shows an optimal solution to the example above.
By different plans of who dances in the first half and who does in the o
最低0.47元/天 解锁文章
1002
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
