题目描述
传送门
题意:给出两条线段,雨水从空中竖直落下,问线段上能积多少水。
题解
情况比较多,需要特判的地方也比较多
首先要判断线段是否相交(叉积),假设线段相交
最简单的当然是这种情况
不过还会有一些特殊情况
这样的情况都是没有办法积水的
所以需要用斜率什么的各种特判
最后输出的时候+eps,貌似是什么奇怪的bug,让double运算的时候出了负数,然后就会有什么-0.00之类的东西。。。
代码
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
const double inf=1e9;
const double eps=1e-12;
int dcmp(double x)
{
if (x<=eps&&x>=-eps) return 0;
return (x>0)?1:-1;
}
struct Vector
{
double x,y;
Vector(double X=0,double Y=0)
{
x=X,y=Y;
}
};
typedef Vector Point;
struct Line
{
Point p,q;
double k;
Line(Point P=Point(0,0),Point Q=Point(0,0))
{
p=P,q=Q;
if (dcmp(p.x-q.x)==0) k=inf;
else k=(p.y-q.y)/(p.x-q.x);
}
};
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 a) {return Vector(A.x*a,A.y*a);}
int T;
double a,b,c,d,x,y,h,ans;
Line l,m;
Vector v1,v2,v3;
Point o;
bool flag=true;
double Dot(Vector A,Vector B)
{
return A.x*B.x+A.y*B.y;
}
double Cross(Vector A,Vector B)
{
return A.x*B.y-A.y*B.x;
}
double Len(Vector A)
{
return sqrt(Dot(A,A));
}
Point GLI(Line l,Line m)
{
Point P=l.q,Q=m.q;
Vector v=l.p-l.q,w=m.p-m.q,u=P-Q;
double t=Cross(w,u)/Cross(v,w);
return P+v*t;
}
double DisTL(Point P,Point A,Point B)
{
Vector v1=B-A,v2=P-A;
return fabs(Cross(v1,v2)/Len(v1));
}
int main()
{
scanf("%d",&T);
while (T--)
{
scanf("%lf%lf%lf%lf",&a,&b,&c,&d);
if (dcmp(b-d)<0) swap(a,c),swap(b,d);
l=Line(Point(a,b),Point(c,d));
scanf("%lf%lf%lf%lf",&a,&b,&c,&d);
if (dcmp(b-d)<0) swap(a,c),swap(b,d);
m=Line(Point(a,b),Point(c,d));
if (l.p.y<m.p.y) swap(l,m);
if (!l.k||!m.k) {puts("0.00");continue;}
flag=true;
v1=l.p-l.q;v2=m.p-l.q;v3=m.q-l.q;
x=dcmp(Cross(v1,v2));y=dcmp(Cross(v1,v3));
if ((x&&x==y)||(!x&&!y)) flag=false;
v1=m.p-m.q;v2=l.p-m.q;v3=l.q-m.q;
x=dcmp(Cross(v1,v2));y=dcmp(Cross(v1,v3));
if ((x&&x==y)||(!x&&!y)) flag=false;
if (!flag) puts("0.00");
else
{
if (dcmp(l.k)==dcmp(m.k)&&((dcmp(l.p.x-m.p.x)>=0&&dcmp(m.k-l.k)<=0)||(dcmp(l.p.x-m.p.x)<=0&&dcmp(m.k-l.k)>=0))) {puts("0.00");continue;}
o=GLI(l,m);
h=m.p.y-o.y;
d=DisTL(m.p,l.p,l.q);
if (dcmp(l.k-inf)==0) ans=d*h/2.0;
else
{
double alpha=fabs(atan(l.k));
d=fabs(d/sin(alpha));
ans=d*h/2.0;
}
printf("%.2lf\n",ans+eps);
}
}
}