2019 ICPC Asia Nanjing Regional（Triangle）

Triangle:
题解：思维想全面就行

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL maxn=2e5+10;
const LL mod=1e9+7;
const double eps=1e-7;
struct node{
    double x,y;
}p[6];
struct segment{
    double x1,y1,x2,y2;
}seg[5];
int judge(segment s,node r)//判断点r是否在直线s上
{
    double x1=s.x2-s.x1,y1=s.y2-s.y1;
    double x2=r.x-s.x1,y2=r.y-s.y1;
    if(x1*y2-x2*y1==0){
        if(r.x==s.x1&&r.y==s.y1||r.x==s.x2&&r.y==s.y2){
            return 1;
        }
        else
        if(r.x>=min(s.x1,s.x2)&&r.x<=max(s.x1,s.x2)&&r.y>=min(s.y1,s.y2)&&r.y<=max(s.y1,s.y2)){
            return 2;
        }
    }
    return 0;
}
double cal(node p1,node p2,node p3)//由三个点来求三角形的面积
{
    double x1=p2.x-p1.x,y1=p2.y-p1.y;
    double x2=p3.x-p1.x,y2=p3.y-p1.y;
    return fabs(x1*y2-x2*y1);
}
double Dis(double x1,double y1,double x2,double y2)//求两点之间的距离
{
    return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
double pk(segment s,node p1)//求点p1到线段s上的距离
{
    double x1=s.x1,x2=s.x2,y1=s.y1,y2=s.y2;
    double x=p1.x,y=p1.y;
    double css=(x2-x1)*(y-y1)-(x-x1)*(y2-y1);
    double si=fabs(css/(Dis(x1,y1,x,y)*Dis(x1,y1,x2,y2)));
    return Dis(x,y,x1,y1)*si;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--){
    for(int i=1;i<=4;i++){
        scanf("%lf%lf",&p[i].x,&p[i].y);
    }
    int n=0;
    for(int i=1;i<=3;i++){
        for(int j=i+1;j<=3;j++){
            ++n;
            seg[n].x1=p[i].x;seg[n].y1=p[i].y;seg[n].x2=p[j].x;seg[n].y2=p[j].y;
        }
    }
    int f=0;
    for(int i=1;i<=n;i++){
        f=judge(seg[i],p[4]);
        if(f>0){
            break;
        }
    }
    if(!f){
        printf("-1\n");
    }
    else{
         if(f==1){
            int ko=0;
            for(int i=1;i<=3;i++){
                if(p[4].x==p[i].x&&p[4].y==p[i].y){
                    ko=i;break;
                }
            }
            if(ko==1){
                printf("%.12f %.12f\n",(p[2].x+p[3].x)/2.0,(p[2].y+p[3].y)/2.0);
            }
            else
            if(ko==2){
                printf("%.12f %.12f\n",(p[1].x+p[3].x)/2.0,(p[1].y+p[3].y)/2.0);
            }
            else{
                printf("%.12f %.12f\n",(p[1].x+p[2].x)/2.0,(p[1].y+p[2].y)/2.0);
            }
         }
         else{
           double area=cal(p[1],p[2],p[3])/2.0;
           int j=0;
           for(int i=1;i<=n;i++){
            node p1,p2;
            p1.x=seg[i].x1;p1.y=seg[i].y1;
            p2.x=seg[i].x2;p2.y=seg[i].y2;
            if(cal(p1,p2,p[4])==0){
                j=i;break;
            }
           }
           if(j==1){
              double h2=pk(seg[2],p[4]);
              double ko=area/h2;
              double D=Dis(seg[2].x1,seg[2].y1,seg[2].x2,seg[2].y2);
              if(ko<=D){
                   double bx=seg[2].x2-seg[2].x1;
                   double by=seg[2].y2-seg[2].y1;
                   double co=bx/D;
                   double si=by/D;
                   printf("%.12f %.12f\n",seg[2].x1+ko*co,seg[2].y1+ko*si);
              }
              else{
                   double h3=pk(seg[3],p[4]);
                   ko=area/h3;
                   D=Dis(seg[3].x1,seg[3].y1,seg[3].x2,seg[3].y2);
                   double bx=seg[3].x2-seg[3].x1;
                   double by=seg[3].y2-seg[3].y1;
                   double co=bx/D;
                   double si=by/D;
                   printf("%.12f %.12f\n",seg[3].x1+ko*co,seg[3].y1+ko*si);
              }
           }
           else
           if(j==2){
              double h1=pk(seg[1],p[4]);
              double ko=area/h1;
              double D=Dis(seg[1].x1,seg[1].y1,seg[1].x2,seg[1].y2);
              if(ko<=D){
                   double bx=seg[1].x2-seg[1].x1;
                   double by=seg[1].y2-seg[1].y1;
                   double co=bx/D;
                   double si=by/D;
                   printf("%.12f %.12f\n",seg[1].x1+ko*co,seg[1].y1+ko*si);
              }
              else{
                   double h3=pk(seg[3],p[4]);
                   ko=area/h3;
                   D=Dis(seg[3].x1,seg[3].y1,seg[3].x2,seg[3].y2);
                   double bx=seg[3].x2-seg[3].x1;
                   double by=seg[3].y2-seg[3].y1;
                   double co=bx/D;
                   double si=by/D;
                   printf("%.12f %.12f\n",seg[3].x1+ko*co,seg[3].y1+ko*si);
              }
           }
           else{
              double h1=pk(seg[1],p[4]);
              double ko=area/h1;
              double D=Dis(seg[1].x1,seg[1].y1,seg[1].x2,seg[1].y2);
              if(ko<=D){
                   double bx=seg[1].x2-seg[1].x1;
                   double by=seg[1].y2-seg[1].y1;
                   double co=bx/D;
                   double si=by/D;
                   printf("%.12f %.12f\n",seg[1].x1+ko*co,seg[1].y1+ko*si);
              }
              else{
                   double h2=pk(seg[2],p[4]);
                   ko=area/h2;
                   D=Dis(seg[2].x1,seg[2].y1,seg[2].x2,seg[2].y2);
                   double bx=seg[2].x2-seg[2].x1;
                   double by=seg[2].y2-seg[2].y1;
                   double co=bx/D;
                   double si=by/D;
                   printf("%.12f %.12f\n",seg[2].x1+ko*co,seg[2].y1+ko*si);
              }
           }
         }
    }
    }
    return 0;
}