UVA11437 Triangle Fun

题意：求三角形内部构造的三角形的面积，构造方法是每个定点连接边上三分之一的点得出的三个交点。
思路：运用向量的运算和两条线求交点的函数，求出三角形的三个顶点，最后用叉积求面积，最后要四舍五入成整数。

#include<bits/stdc++.h>
using namespace std;
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,Vector B) { return Vector(A.x-B.x, A.y-B.y); }
Vector operator * (Vector A,double p) { return Vector(A.x*p, A.y*p); }
Vector operator / (Vector A,double p) { return Vector(A.x/p, A.y/p); }
bool operator < (const Point&a,const Point&b){
    return a.x<b.x||(a.x==b.x && a.y<b.y);
}
const double eps=1e-10;
int dcmp(double x){
    if(fabs(x)<eps) return 0; else 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 Length(Vector A) { return sqrt(Dot(A,A)); }
double Angle(Vector A,Vector B) { return acos(Dot(A,B) / Length(A) / Length(B) ); }
double Cross(Vector A,Vector B) { return A.x*B.y-A.y*B.x; }
/**
first input right Edge,Cross product be Positive.
*/
double Area2(Point A,Point B,Point C) { return Cross(B-A,C-A); }
Vector Rotate(Vector A,double rad){
    return Vector(A.x*cos(rad)-A.y*sin(rad), A.x*sin(rad)+A.y*cos(rad));
}
Point GetLineIntersection(Point P,Vector v,Point Q,Vector w){
    Vector u = P - Q;
    double t = Cross(w,u) / Cross(v,w);
    return P + v*t;
}
bool SegmentProperIntersection(Point a1,Point a2,Point b1,Point b2){
    double c1 = Cross(a2-a1,b1-a1), c2 = Cross(a2-a1,b2-a1),
            c3 = Cross(b2-b1,a1-b1), c4 = Cross(b2-b1,a2-b1);
    return dcmp(c1)*dcmp(c2)<0 && dcmp(c3)*dcmp(c4)<0;
}
bool OnSegment(Point p,Point a1,Point a2){
    return dcmp(Cross(a1-p,a2-p))==0&&dcmp(Dot(a1-p,a2-p))<0;
}
double distance_(Point A,Point B){
    return sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));
}
Point SolutionThePoint(Point A,Point B,double dis){
    double D = distance_(A,B);
    double Proportion = dis / D;
    return A + (B-A)*Proportion;
}
double Min,Max;
double DistanceToSegment(Point P,Point A,Point B){
    if(A==B) return Length(P-A);
    Vector v1=B-A,v2=P-A,v3=P-B;
    if(dcmp(Dot(v1,v2))<0) return Length(v2);
    else if(dcmp(Dot(v1,v3))>0) return Length(v3);
    else return fabs(Cross(v1,v2)) / Length(v1);
}
void update(Point P,Point A,Point B){
//    cout<<"P:"<<P.x<<","<<P.y<<"__A:"<<A.x<<","<<A.y<<"__B:"<<B.x<<","<<B.y<<endl;
    Min = min(Min,DistanceToSegment(P,A,B));
    Max = max(Max,DistanceToSegment(P,A,B));
//    Max = max(Max,Length(P-B));
//    cout<<"Min"<<Min<<"___"<<"Max"<<Max<<endl;

}
Point read_Point(){
    double a,b;
    scanf("%lf%lf",&a,&b);
    return Point(a,b);
}
Point getP(Point A,Point B,Point C){
    Point D=B+(C-B)/3.0;
    Vector AD = D-A;
    Point E=C+(A-C)/3.0;
    Vector BE = E-B;
    return GetLineIntersection(A,AD,B,BE);
}
typedef long long LL;
int main()
{
   int  t;
   scanf("%d",&t);
   Point A,B,C,P,Q,R;
   while(t--){
        A=read_Point();
        B=read_Point();
        C=read_Point();
        P=getP(A,B,C);
        Q=getP(B,C,A);
        R=getP(C,A,B);
        long double ans=fabs(Cross(Q-P,R-P))/2.0;
        printf("%.0lf\n",ans);
   }
    return 0;
}

血洗几何