HihoCoder - 1429 Problem H. A New Ground Heating Device(K次圆并

传送门

Problem

A brand new photosensitive ground heating device is under developing.

This time, to test these devices and help local farmers, engineers placed several devices on the ground in a greenhouse. (You can assume the ground of the greenhouse as a plane and the height of all devices are zero)

There is only a light source in the greenhouse. Its coordinate at the plane must be (0,0),but you can put it at any height above the ground(or on the ground) as you want.

The effective warming radius of the  i th device is  WLi×Zi  , among which  w  is the power of the light source,  Li  is the distance between light source and the  i th device, while owing to different degree of wear and tear, photoresistance factor of each device,  Zi , may be different.

The winter is so harsh that a piece of land in this greenhouse is suitable for planting only when it is heated by at least  K  devices at the same time.

Considering the efficiency of production, farmers require that the area of arable land should be greater than  S .

Engineers wonder, to satisfy the heating demand raised by farmers, what is the maximum height of the light source.

主要意思就是 n 个机器，每个机器制热的覆盖半径是  WLi×Zi  ，其中 W 和  Zi  均为定值， Li  指机器与 light source 的三维距离（机器的坐标已固定，且高度一定为 0 ，light source 的横纵坐标均为 0， 高度可变）。求 light source 可行的最高高度，使得满足至少有 S 的面积能被至少 K 个机器制热半径覆盖。

解题思路

二分枚举 light source 的高度，对每次产生的高度判断被  ≥K  个机器覆盖的面积是否大于等于 S。

对于求 K 机器覆盖的面积，套用 K 次圆并的模板。

:cry: 模板题。

//china no.1
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;

#define pi acos(-1)
#define PI acos(-1)
#define endl '\n'
#define srand() srand(time(0));
#define me(x,y) memset(x,y,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0); cin.tie(0);
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define W while
#define sgn(x) ((x) < 0 ? -1 : (x) > 0)
#define bug printf("***********\n");
#define db double
typedef long long LL;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,-1,1,-1,1};
const int maxn=1e3+10;
const int maxx=1e6+100;
const double EPS=1e-8;
const double eps=1e-8;
const int mod=10000007;
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
template <class T>
inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}
while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');
while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}

inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;
while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}
else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}
if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}
if(IsN) num=-num;return true;}

void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}
void print(LL a){ Out(a),puts("");}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
//cerr << "run time is " << clock() << endl;



db sqr(db x)
{
   return x*x;
}
int dcmp(double x)
{
    if(fabs(x) < EPS) return 0;
    else return x < 0 ? -1 : 1;
}


struct Circle
{
    double x, y, r, angle;
    int d;
    Circle(){}
    Circle(double xx, double yy, double ang = 0, int t = 0)
    {
        x = xx;  y = yy;  angle = ang;  d = t;
    }
    void get()
    {
        scanf("%lf%lf%lf", &x, &y, &r);
        d = 1;
    }
};

Circle cir[maxn],tp[maxn*2];
double area[maxn];

double dis(Circle a,Circle b)
{
    return sqrt(sqr(a.x - b.x) + sqr(a.y - b.y));
}

double cross(Circle p0,Circle p1,Circle p2)
{
    return (p1.x - p0.x) * (p2.y - p0.y) - (p1.y - p0.y) * (p2.x - p0.x);
}
//圆相交
int CirCrossCir(Circle p1, double r1,Circle p2, double r2,Circle &cp1,Circle &cp2)
{
    double mx = p2.x - p1.x, sx = p2.x + p1.x, mx2 = mx * mx;
    double my = p2.y - p1.y, sy = p2.y + p1.y, my2 = my * my;
    double sq = mx2 + my2, d = -(sq - sqr(r1 - r2)) * (sq - sqr(r1 + r2));
    if (d + eps < 0) return 0; if (d < eps) d = 0; else d = sqrt(d);
    double x = mx * ((r1 + r2) * (r1 - r2) + mx * sx) + sx * my2;
    double y = my * ((r1 + r2) * (r1 - r2) + my * sy) + sy * mx2;
    double dx = mx * d, dy = my * d; sq *= 2;
    cp1.x = (x - dy) / sq; cp1.y = (y + dx) / sq;
    cp2.x = (x + dy) / sq; cp2.y = (y - dx) / sq;
    if (d > eps) return 2; else return 1;
}
bool circmp(const Circle& u, const Circle& v)
{
    return dcmp(u.r - v.r) < 0;
}

bool cmp(const Circle& u, const Circle& v)
{
    if (dcmp(u.angle - v.angle)) return u.angle < v.angle;
    return u.d > v.d;
}
//0.5*r*r*(K-sin(K))
double calc(Circle cir,Circle cp1,Circle cp2)
{
    double ans = (cp2.angle - cp1.angle) * sqr(cir.r)
        - cross(cir, cp1, cp2) + cross(Circle(0, 0), cp1, cp2);
    return ans / 2;
}

void CirUnion(Circle cir[], int n)
{
    Circle cp1, cp2;
    sort(cir, cir + n, circmp);
    for (int i = 0; i < n; ++i)
        for (int j = i + 1; j < n; ++j)
            if (dcmp(dis(cir[i], cir[j]) + cir[i].r - cir[j].r) <= 0)
                cir[i].d++;
    for (int i = 0; i < n; ++i)
    {
        int tn = 0, cnt = 0;
        for (int j = 0; j < n; ++j)
        {
            if (i == j) continue;
            if (CirCrossCir(cir[i], cir[i].r, cir[j], cir[j].r,
                cp2, cp1) < 2) continue;
            cp1.angle = atan2(cp1.y - cir[i].y, cp1.x - cir[i].x);
            cp2.angle = atan2(cp2.y - cir[i].y, cp2.x - cir[i].x);
            cp1.d = 1;    tp[tn++] = cp1;
            cp2.d = -1;   tp[tn++] = cp2;
            if (dcmp(cp1.angle - cp2.angle) > 0) cnt++;
        }
        tp[tn++] = Circle(cir[i].x - cir[i].r, cir[i].y, pi, -cnt);
        tp[tn++] = Circle(cir[i].x - cir[i].r, cir[i].y, -pi, cnt);
        sort(tp, tp + tn, cmp);
        int p, s = cir[i].d + tp[0].d;
        for (int j = 1; j < tn; ++j)
        {
            p = s;  s += tp[j].d;
            area[p] += calc(cir[i], tp[j - 1], tp[j]);
        }
    }
}
int w,k,s,n,t;
int x[maxn],y[maxn];
db z[maxn];
db getR(db x,db y,db h,db z)
{
    db d=sqrt(x*x+y*y+h*h);
    return w*1.0/d/z;
}

int check(db h)
{
    me(cir,0);
    for(int i=0;i<n;i++)
    {
        cir[i].x=x[i];
        cir[i].y=y[i];
        cir[i].d=1;
        cir[i].r=getR(x[i],y[i],h,z[i]);
    }
    me(area,0);
    CirUnion(cir,n);
    if(dcmp(area[k]-s)>=0) return 1;
    return 0;
}
int main()
{
    //freopen( "in.txt" , "r" , stdin );
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d %d %d %d", &n, &w, &k, &s);
        for(int i=0;i<n;i++)
            scanf("%d %d %lf", &x[i], &y[i], &z[i]);
        if(check(500))
        {
            printf("Oops!\n");
        }
        else if(!check(0))
        {
            printf("No solution!\n");
        }
        else
        {
            double l = 0, r = 500, mid;
            int len=50;
            W(len--)
            {
                mid = (l+r) / 2;
                if(check(mid)) l = mid+1;
                else  r = mid-1;
            }
            printf("%.4f\n",l-1);
        }
    }
}