HDU 5299 Circles Game

平均情况$O(nlogn)$的建树，但是在最坏情况下可以退化成$O(n^2)$
下面是题解的建图方式，最后的博弈用树上SG就行

//      whn6325689
//        Mr.Phoebe
//        http://blog.csdn.net/u013007900
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <climits>
#include <complex>
#include <fstream>
#include <cassert>
#include <cstdio>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <ctime>
#include <set>
#include <map>
#include <cmath>
#include <functional>
#include <numeric>
#pragma comment(linker, "/STACK:1024000000,1024000000")

using namespace std;

#define eps 1e-9
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define LLINF 1LL<<62
#define speed std::ios::sync_with_stdio(false);

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef complex<ld> point;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef vector<int> vi;

#define CLR(x,y) memset(x,y,sizeof(x))
#define CPY(x,y) memcpy(x,y,sizeof(x))
#define clr(a,x,size) memset(a,x,sizeof(a[0])*(size))
#define cpy(a,x,size) memcpy(a,x,sizeof(a[0])*(size))

#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define lowbit(x) (x&(-x))

#define MID(x,y) (x+((y-x)>>1))
#define ls (idx<<1)
#define rs (idx<<1|1)
#define lson ls,l,mid
#define rson rs,mid+1,r
#define root 1,1,n

template<class T>
inline bool read(T &n)
{
    T x = 0, tmp = 1;
    char c = getchar();
    while((c < '0' || c > '9') && c != '-' && c != EOF) c = getchar();
    if(c == EOF) return false;
    if(c == '-') c = getchar(), tmp = -1;
    while(c >= '0' && c <= '9') x *= 10, x += (c - '0'),c = getchar();
    n = x*tmp;
    return true;
}
template <class T>
inline void write(T n)
{
    if(n < 0)
    {
        putchar('-');
        n = -n;
    }
    int len = 0,data[20];
    while(n)
    {
        data[len++] = n%10;
        n /= 10;
    }
    if(!len) data[len++] = 0;
    while(len--) putchar(data[len]+48);
}
//-----------------------------------

const int MAXN=20010;

struct Node
{
    int to,nex;
} e[MAXN*2];
int head[MAXN],tot;
int n,vis[MAXN],sg[MAXN],fa[MAXN];

struct Circle
{
    int x;
    int y;
    int r;
    int id;
    bool operator < (const Circle &o) const
    {
        return x < o.x;
    }
} circle[MAXN];

bool cmp(Circle a,Circle b)
{
    return a.r>b.r;
}

void init()
{
    tot=0;
    CLR(vis,0);
    CLR(sg,0);
    CLR(head,-1);
    CLR(fa,0);
}

void addedge(int u,int v)
{
    e[tot].to=v;
    e[tot].nex=head[u];
    head[u]=tot++;
}

void isCross()
{
    for(int i=1; i<=n; i++)
    {
        for(int j=i+1; j<=n && circle[j].x - circle[i].x < circle[i].r; j++)
            if(circle[j].r<circle[i].r && (circle[j].x - circle[i].x)*(circle[j].x - circle[i].x) +  (circle[j].y - circle[i].y)*(circle[j].y - circle[i].y)
                    <  circle[i].r * circle[i].r)
            {
                int pre=fa[j];
                if(!pre||circle[pre].r>circle[i].r)fa[j]=i;
            }

        for(int j=i-1; j>=1 && circle[i].x - circle[j].x < circle[i].r; j--)
            if(circle[j].r<circle[i].r && (circle[j].x - circle[i].x)*(circle[j].x - circle[i].x) +  (circle[j].y - circle[i].y)*(circle[j].y - circle[i].y)
                    <  circle[i].r * circle[i].r)
            {
                int pre=fa[j];
                if(!pre||circle[pre].r>circle[i].r)fa[j]=i;
            }
    }
    for(int i=1; i<=n; i++)
    {
        if(fa[i])
        {
            addedge(i,fa[i]);
            addedge(fa[i],i);
        }
    }
}

void dfs(int u)
{
    vis[u]=1;
    sg[u]=0;
    int v,tmp=0;
    for(int i=head[u]; ~i; i=e[i].nex)
    {
        v=e[i].to;
        if(!vis[v])
        {
            dfs(v);
            sg[u]^=sg[v];
        }
    }
    sg[u]++;
}

int main()
{
    //freopen("data.txt","r",stdin);
    int T;
    read(T);
    while(T--)
    {
        init();
        read(n);
        for(int i=1; i<=n; i++)
            read(circle[i].x),read(circle[i].y),read(circle[i].r);
        sort(circle+1,circle+1+n);
        isCross();
        int ans=0;
        for(int i=1; i<=n; i++)
        {
            if(!fa[i])
            {
                dfs(i);
                ans^=sg[i];
            }
        }
        if(ans==0)
            puts("Bob");
        else
            puts("Alice");
    }
    return 0;
}