51Nod 论学好数学是多么重要 (圆与三角形相交)

#include <iostream>
//#include <fstream>
//#define cin in
typedef  long long ll;
using namespace std;
struct point 
{
    int x;
    int y;
};
ll getdistance(point s1,point s2)
{
    return (s1.x-s2.x)*(s1.x-s2.x)+(s1.y-s2.y)*(s1.y-s2.y);
}
int isTouch(point c,int r, point s1,point s2)
{
   //两点式求得ABC
    ll A=s2.y-s1.y;
    ll B=s1.x-s2.x;
    ll C=s2.x*s1.y-s1.x*s2.y;
    //余弦定理
    ll cs1=(c.x-s1.x)*(c.x-s1.x)+(c.y-s1.y)*(c.y-s1.y);
    ll cs2=(c.x-s2.x)*(c.x-s2.x)+(c.y-s2.y)*(c.y-s2.y);
    ll s1s2=(s1.x-s2.x)*(s1.x-s2.x)+(s1.y-s2.y)*(s1.y-s2.y);
    
    //将点到直线距离公式转换
    ll left=(A*c.x+B*c.y+C)*(A*c.x+B*c.y+C);
    ll right=(A*A+B*B)*r*r;
    if(left>right)//d>r
    return 0;
    else
 /*  {
        ll dotproduct_s = (-B) * (c.x - s1.x) + A * (c.y - s1.y);         
ll dotproduct_t = B * (c.x - s2.x) - A * (c.y - s2.y);         
return (dotproduct_s >= 0 && dotproduct_t >= 0);  
    }
    */
    return (s1s2+cs1-cs2>=0&&cs2+s1s2-cs1>=0);//两种都可以 
    //有两个交点则线段端点与圆心的两个夹角必为锐角,或直角
    return 0;
    
}
void main()
{
// ifstream in;
// in.open("C:\\Users\\cong\\Desktop\\1.txt");
    int t,r;
    point circle,s1,s2,s3;
    cin>>t;
    while(t-->0)
    {
        cin>>circle.x>>circle.y;
        cin>>r;
        cin>>s1.x>>s1.y;
        cin>>s2.x>>s2.y;
        cin>>s3.x>>s3.y;
        ll s1c,s2c,s3c;
        s1c=getdistance(circle,s1);
        s2c=getdistance(circle,s2);
        s3c=getdistance(circle,s3);
        ll r2=r*r;
        if(s1c<r2&&s2c<r2&&s3c<r2)//三点在圆内，不可能相交
        {
            cout<<"No"<<endl;
        }
        else if(s1c>r2&&s2c>r2&&s3c>r2)//三点在圆外，有可能
        {
            int flag1=isTouch(circle,r,s1,s2);
            int flag2=isTouch(circle,r,s1,s3);
            int flag3=isTouch(circle,r,s2,s3);
            if(flag1||flag2||flag3)
            {
                cout<<"Yes"<<endl;
            }
            else cout<<"No"<<endl;
        }
        else cout<<"Yes"<<endl;
    }
    
}