Manors HDU

Manors

HDU - 5462

题意：有ｎ个人，每个人占据ｍ个点，每个人所属区域是该区域内的点到自己控制的点的距离小于其他人．

化简一下题目给的式子，得到直线方程，半平面交求解即可～

#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const int maxn = 110;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
struct Point {
    double x,y;
    Point (double x = 0, double y = 0) : x(x), y(y) {}
};
typedef Point Vector;
Vector operator + (Vector a, Vector b) {
    return Vector (a.x + b.x, a.y + b.y);
}
Vector operator * (Vector a, double s) {
    return Vector (a.x * s, a.y * s);
}
Vector operator / (Vector a, double p) {
    return Vector (a.x / p, a.y / p);
}
Vector operator - (Point a, Point b) {
    return Vector (a.x - b.x, a.y - b.y);
}
bool operator < (Point a, Point b) {
    return a.x < b.x || (a.x == b.x && a.y < b.y);
}
int dcmp (double x) {
    if(fabs(x) < eps) return 0;
    return x < 0 ? -1 : 1;
}
bool operator == (const Point &a, const Point &b) {
    return dcmp(a.x - b.x) == 0 && dcmp(a.y - b.y) == 0;
}
double Dot(Vector a, Vector b) {
    return a.x * b.x + a.y * b.y;
}
double Angle(Vector a){
    return atan2(a.y, a.x);
}
double Length(Vector a) {
    return sqrt(Dot(a, a));
}
double Cross (Vector a, Vector b) {
    return a.x * b.y - a.y * b.x;
}
//半平面交
struct Line {
    Point p;
    Vector v;
    double rad;
    Line () {}
    Line (Point p, Vector v) : p(p), v(v) {
        rad = atan2(v.y, v.x);
    }
    bool operator < (const Line &L) const {
        return rad < L.rad;
    }
};
bool OnLeft(Line L, Point p) {
    return Cross(L.v, p - L.p) > 0;
}
Point GetLineIntersection (Line a, Line b) {
    Vector u = a.p - b.p;
    double t = Cross(b.v, u) / Cross(a.v, b.v);
    return a.p + a.v*t;
}

int HalfplaneIntersection(Line *L, int n, Point *poly) {
    sort(L, L+n);
    int first,last;
    Point *p = new Point[n];
    Line *q = new Line[n];  //双端队列
    q[first = last = 0] = L[0];
    for(int i = 1; i < n; i++) {
        while(first < last && !OnLeft(L[i], p[last-1])) last--;   //去尾
        while(first < last && !OnLeft(L[i], p[first])) first++; 
        q[++last] = L[i];
        if(dcmp(Cross(q[last].v, q[last-1].v)) == 0) {
            last--;
            if(OnLeft(q[last], L[i].p)) q[last] = L[i];
        }
        if(first < last) p[last-1] = GetLineIntersection (q[last-1],q[last]);
    }
    while(first < last && !OnLeft(q[first], p[last-1])) last--;  //删除无用平面
    if(last - first <= 1) {
        delete []p;
        delete []q;
       return 0;  //空集    
    }
    p[last] = GetLineIntersection (q[last], q[first]);
    int m = 0;
    for(int i = first; i <= last; i++) poly[m++] = p[i];
    delete []p;
    delete []q;
    return m;
}

double ConvexPolygonArea(Point *p, int n) {
    double area = 0;
    for(int i = 1; i < n-1; i++) {
        area += Cross(p[i] - p[0], p[i+1] - p[0]);
    }
    return area / 2;
}
double X[maxn], Y[maxn], FX[maxn], FY[maxn];
Point poly[maxn], p1[6];
Line line[maxn];
int main(){
    //freopen("in.txt", "r", stdin);
    int t, kase = 0;
    scanf("%d", &t);
    while(t--){
        int n, m;
        scanf("%d %d", &n, &m);
        double x, y;
        for(int i = 0; i < n; i++){
            X[i] = Y[i] = FX[i] = FY[i] = 0;
            for(int j = 0; j < m; j++){
                scanf("%lf %lf", &x, &y);
                X[i] += x;
                Y[i] += y;
                FX[i] += x*x;
                FY[i] += y*y;
            }
        }
        int cnt = 0;
        p1[0] = Point(0, 4095); p1[1] = Point(0, 0);
        p1[2] = Point(4095, 0); p1[3] = Point(4095, 4095);
        printf("Case #%d:", ++kase);
        for(int i = 0 ; i < n; i++){
            cnt = 0;
            for(int j = 0; j < n; j++) if(i!=j){
                double a = 2 * (X[i] - X[j]);
                double b = 2 * (Y[i] - Y[j]);
                double c = FX[j] + FY[j] - FX[i] - FY[i];
                Vector v = Vector(b, -a);
                Point p;
                if(fabs(a) > fabs(b)) p = Point(-c/a, 0);
                else p = Point(0, -c/b);
                line[cnt++] = Line(p, v);
            }
            for(int i = 0; i < 4; i++){
                line[cnt++] = Line(p1[i], p1[(i+1)%4] - p1[i]);
            }
            int sz = HalfplaneIntersection(line, cnt, poly);
            double ans = ConvexPolygonArea(poly, sz);
            printf(" %d", int(ans+0.5));
        }
        puts("");
    }
    return 0;
}