【BZOJ1132】【POI2008】Tro（计算几何）

Description

平面上有N个点. 求出所有以这N个点为顶点的三角形的面积和 N<=3000

---

Solution

将点按$y$排序，枚举一个点，将在它后面的点以它为原点极角排序，用前缀和计算叉积即可。

---

Code

/************************************************
 * Au: Hany01
 * Prob: triangle
 * Email: hany01dxx@gmail.com & hany01@foxmail.com
 * Inst: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define PB(a) push_back(a)
#define MP(a, b) make_pair(a, b)
#define SZ(a) ((int)(a).size())
#define ALL(a) a.begin(), a.end()
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read() {
    static int _, __; static char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 3005;
const LD eps = 1e-7, pi = acos(-1.);

int n, m;
LD ans;

struct Point {
    int x, y, id;
    LD ang;
    Point(int x = 0, int y = 0): x(x), y(y) {}
}p[maxn], q[maxn];
inline bool cmpy(Point A, Point B) { return A.y < B.y; }
inline bool cmpang (Point A, Point B) { return A.ang < B.ang; }
typedef Point Vector;
Vector operator - (Point A, Point B) { return Point(A.x - B.x, A.y - B.y); }
inline int Cross(Vector A, Vector B) { return A.x * B.y - A.y * B.x; }
inline LD Angle(Vector p) { return atan2(p.y, p.x); }

inline void solve(Point p) {
    LD smx = 0, smy = 0;
    For(i, 1, m) ans += smx * q[i].y - smy * q[i].x, smx += q[i].x, smy += q[i].y;
}

int main()
{
    n = read();
    For(i, 1, n) p[i].x = read(), p[i].y = read(), p[i].ang = Angle(p[i]);
    sort(p + 1, p + 1 + n, cmpy);

    For(i, 1, n - 1) {
        m = 0;
        For(j, i + 1, n) if (i ^ j) q[++ m] = p[j] - p[i], q[m].ang = Angle(q[m]);
        sort(q + 1, q + 1 + m, cmpang);
        solve(p[i]);
    }
    printf("%.1Lf\n", ans / 2);

    return 0;
}