HDU 2857 Point of Intersection

先求投影，然后对称点，然后直线交点

#include<bits/stdc++.h>
using namespace std;
typedef double db;
const db eps=1e-8,pi=acos(-1);
int sign(db x){if(x>eps)return 1;if(x<-eps)return -1;return 0;}
int cmp(db x,db y){return sign(x-y);}
int intersect(db l1,db r1,db l2,db r2){
    if (l1>r1) swap(l1,r1); if (l2>r2) swap(l2,r2); return cmp(r1,l2)!=-1&&cmp(r2,l1)!=-1;
}
int inmid(db k1,db k2,db k3){return sign(k1-k3)*sign(k2-k3)<=0;}
struct Point{
    db x,y;
    Point operator + (const Point &a)const{return Point{a.x+x,a.y+y};}
    Point operator - (const Point &a)const{return Point{x-a.x,y-a.y};}
    Point operator * (db a) const{return (Point){x*a,y*a};}
    Point operator / (db a) const{return (Point){x/a,y/a};}
    void input(){scanf("%lf%lf",&x,&y);}
};
db cross(Point p1,Point p2){return p1.x*p2.y-p1.y*p2.x;}
db cross(Point p0,Point p1,Point p2){return cross(p1-p0,p2-p0);}
db dot(Point p1,Point p2){return p1.x*p2.x+p1.y*p2.y;}
struct Line{
    Point s,e;
    void input(){scanf("%lf%lf%lf%lf",&s.x,&s.y,&e.x,&e.y);}
    Point vec(){return e-s;}
    db length(){return sqrt(dot(s-e,s-e));}
    db length2(){return dot(s-e,s-e);}
};
bool checkLS(Line l1,Line l2){//直线l1,线段l2
    return sign(cross(l2.s,l1.s,l1.e))*sign(cross(l2.e,l1.s,l1.e))<=0;
}
int checkSS(Line l1,Line l2){
    return intersect(l1.s.x,l1.e.x,l2.s.x,l2.e.x)&&intersect(l1.s.y,l1.e.y,l2.s.y,l2.e.y)&&checkLS(l1,l2)&&checkLS(l2,l1);
}
Point project(Line l,Point p){
    return l.s+l.vec()*dot(p-l.s,l.vec())/l.length2();
}
Point reflect(Line l,Point p){
    return project(l,p)*2-p;
}
Point getLL(Line l1,Line l2){
    db w1=cross(l2.s,l1.s,l2.e),w2=cross(l2.s,l2.e,l1.e); return (l1.s*w2+l1.e*w1)/(w1+w2);
}
db area(vector<Point> A){
    db ans=0;
    for (int i=0;i<A.size();i++) ans+=cross(A[i],A[(i+1)%A.size()]);
    return ans/2;
}
int main(){
    int T;cin>>T;while(T--){
        Point a,b;
        Line c;c.input();
        a.input();b.input();
        a=reflect(c,a);
        Line d={a,b};
        printf("%.3lf %.3lf\n",getLL(c,d).x,getLL(c,d).y);
    }
}