bzoj:3616: War

#include<cmath>
#include<bitset>
#include<cstdio>
#include<vector>
#include<algorithm>
#define ii inline int
#define MN 36000
#define MM 5000000
using namespace std;

int n,m,f,ro=0,num=0,xx,X,o,la=0,NO,l[MN+1],k;
double MMH=0;
char cs;
ii read(){
    cs=getchar();xx=0;f=1;
    while(cs<‘0‘||cs>‘9‘) {if (cs==‘-‘) f=-1;cs=getchar();}
    while(cs>=‘0‘&&cs<=‘9‘) xx=xx*10+cs-48,cs=getchar();
    return xx*f;
}
struct tr{
    int x,y,r,a;
    friend bool operator<(tr a,tr b){if (X) return a.y<b.y;else return a.x<b.x;}
    friend bool operator ==(tr a,tr b){return (a.x==b.x)&&(a.y==b.y);}
}a[MN+1],aw;
struct tree{
    int xa,xi,ya,yi,l,r;
}t[MN+1];
struct na{
    int y,ne;
}b[MM];
inline void in(int x,int y){
    b[++num].y=y;b[num].ne=l[x];l[x]=num;
}
bitset<MN+1> G[MN+1];
vector <int> V[MN+1];
ii S(int x){return x*x;}
ii A(int a,int b){return a>b?a:b;}
ii I(int a,int b){return a<b?a:b;}
ii B(int a){return a<0?-a:a;}
ii build(int l,int r,int now){
    X=now;
    int mid=(l+r)>>1;
    nth_element(a+l,a+mid,a+r+1);
    t[mid].xa=t[mid].xi=a[mid].x;
    t[mid].ya=t[mid].yi=a[mid].y;
    t[mid].l=t[mid].r=0;
    if (l<mid) t[mid].l=build(l,mid-1,now^1),
    t[mid].xa=A(t[t[mid].l].xa,t[mid].xa),
    t[mid].xi=I(t[t[mid].l].xi,t[mid].xi),
    t[mid].ya=A(t[t[mid].l].ya,t[mid].ya),
    t[mid].yi=I(t[t[mid].l].yi,t[mid].yi);
    if (mid<r) t[mid].r=build(mid+1,r,now^1),
    t[mid].xa=A(t[t[mid].r].xa,t[mid].xa),
    t[mid].xi=I(t[t[mid].r].xi,t[mid].xi),
    t[mid].ya=A(t[t[mid].r].ya,t[mid].ya),
    t[mid].yi=I(t[t[mid].r].yi,t[mid].yi);
    return mid;
}
ii gnm(int j){return A(a[NO].x-t[j].xa,0)+A(t[j].xi-a[NO].x,0)+A(a[NO].y-t[j].ya,0)+A(t[j].yi-a[NO].y,0);}
ii gnq(int j){return S(A(a[NO].x-t[j].xa,0)+A(t[j].xi-a[NO].x,0))+S(A(a[NO].y-t[j].ya,0)+A(t[j].yi-a[NO].y,0));}
ii gmm(int j){return A(B(a[NO].x-t[j].xa),B(a[NO].x-t[j].xi))+A(B(a[NO].y-t[j].yi),B(a[NO].y-t[j].ya));}
ii gmq(int j){return S(A(B(a[NO].x-t[j].xa),B(a[NO].x-t[j].xi)))+S(A(B(a[NO].y-t[j].yi),B(a[NO].y-t[j].ya)));}
ii in(int x){
    if (gmq(x)<=a[NO].r) return 1;
    if (gmm(x)<=a[NO].a) return 1;
    if (gnq(x)<=a[NO].r) return 2;
    if (gnm(x)<=a[NO].a) return 2;
    return 0;
}
ii ju(int x){
    if (S(a[x].x-a[NO].x)+S(a[x].y-a[NO].y)<=a[NO].r) return 1;
    if (B(a[x].x-a[NO].x)+B(a[x].y-a[NO].y)<=a[NO].a) return 1;
    return 0;
}
ii que(int p){
    int u=in(p);
    if (u)
    if (u==1) G[p][NO]=1;else{
        if (ju(p)) in(p,NO);
        if (t[p].l) que(t[p].l);
        if (t[p].r) que(t[p].r);
    }
}
inline void dw(int p){
    if (t[p].l) G[t[p].l]|=G[p],dw(t[p].l);
    if (t[p].r) G[t[p].r]|=G[p],dw(t[p].r);
    for (register int i=l[p];i;i=b[i].ne) G[p][b[i].y]=1;
}
int main(){
    register int i,j;
    n=read();m=read();k=read();
    for (i=1;i<=n;i++) a[i].x=read(),a[i].y=read(),a[i].r=S(read()),a[i].a=read(),V[read()].push_back(i);
    ro=build(1,n,0);
    for (NO=1;NO<=n;NO++) que(ro);
    dw(ro);
    for (i=1;i<=k;i++){
        G[0]=0;
        for (j=0;j<V[i].size();j++) G[0]|=G[V[i][j]];
        for (j=0;j<V[i].size();j++) G[0][V[i][j]]=0;
        MMH+=pow(1.0-(1.0*G[0].count()/n),m);
    }
    printf("%.6lf\n",MMH);
}