BZOJ 4561 [JLoi2016]圆的异或并

扫描线

一个圆拆成左右端点。扫到左端点时，加入圆的上下端点，在set里找前驱（在此圆上方的第一个上端点或下端点）。如果前驱是上端点，说明此圆被内含，否则相离。扫到右端点时删除此圆的上下端点。

#include<set>
#include<cmath>
#include<cstdio>
#include<algorithm>
#define N 200005
#define ll long long
using namespace std;
int x0, ff[N];
struct circle
{
    int x, y, r;
}c[N];
struct line
{
    int id, x, f;
}l[N<<1];
double sqr(int x)
{
    return 1ll*x*x;
}
bool operator < (line a, line b)
{
    double xx = c[a.id].y + a.f * sqrt(sqr(c[a.id].r) - sqr(c[a.id].x - x0));
    double yy = c[b.id].y + b.f * sqrt(sqr(c[b.id].r) - sqr(c[b.id].x - x0));
    if(xx!=yy)return xx < yy;
    else return a.f<b.f;
}
bool cmp(line a, line b)
{
    return a.x < b.x;
}
set<line>s;
int main()
{
    int n;
    scanf("%d",&n);
    for(int i = 1; i <= n; i++)
    {
        scanf("%d%d%d",&c[i].x,&c[i].y,&c[i].r);
        l[i*2-1] = (line){i,c[i].x-c[i].r, 1};
        l[i*2  ] = (line){i,c[i].x+c[i].r,-1};
    }
    sort(l+1,l+1+2*n,cmp);
    set<line>::iterator it;
    for(int i = 1, ii = 2*n; i <= ii; i++)
    {
        x0 = l[i].x;
        if(l[i].f == 1)
        {
            it = s.upper_bound((line){l[i].id,0,1});
            if(it == s.end() ) ff[l[i].id] = 1;
            else
            {
                if((*it).f == -1)ff[l[i].id] = ff[(*it).id];
                else ff[l[i].id] = -ff[(*it).id];
            }
            s.insert((line){l[i].id,0, 1});
            s.insert((line){l[i].id,0,-1});
        }
        else
        {
            s.erase((line){l[i].id,0, 1});
            s.erase((line){l[i].id,0,-1});
        }
    }
    ll ans = 0;
    for(int i = 1; i <= n; i++)
        ans += ff[i] * sqr(c[i].r);
    printf("%lld\n",ans);
}