poj 2826 一道神奇的水题，死活都过不了，等以后再看吧

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<string>
#include<stdlib.h>
#include<cmath>
#include<queue>
#include<algorithm>
using namespace std;
#define rd(x) scanf("%d",&x)
#define rdd(x,y) scanf("%d%d",&x,&y)
#define rddd(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define rdddd(x,y,z,w) scanf("%d%d%d%d",&x,&y,&z,&w)
#define rds(s) scanf("%s",s)
#define rep(i,n) for(int i=0;i<n;i++)
#define LL long long
const int N = 100;
const int M=5e5+10;
const int inf=1e9;
const double eps=1e-5;
const int MOD=1e9+7;
int n,m;
struct Point{
    double x,y;
    int id;
    Point(){

    }
    Point(double _x,double _y){
        x=_x;y=_y;
    }
    bool operator < (const Point&a) const{
        if(y==a.y) return x<a.x;
        return y<a.y;
    }
};
Point p1,p2,p3,p4;
struct Seg{
    Point s,e;
    Seg(){}
    Seg(Point _s,Point _e){
        s=_s;
        e=_e;
    }
    Seg(double x,double y,double xx,double yy){
        s.x=x;s.y=y;
        e.x=xx;e.y=yy;
    }
};
double cross(Point a,Point b,Point c){
    return (b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.x-a.x);
}
double dist(Point a,Point b){
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
int sgn(double x){ return x<-eps?-1:x<eps?0:1;}

int inter(Seg a,Seg b){
    Point p1,p2,p3,p4;
    p1=a.s;p2=a.e;
    p3=b.s;p4=b.e;
    if (!(min(p1.x,p2.x)<=max(p3.x,p4.x) &&
    min(p3.x,p4.x)<=max(p1.x,p2.x) &&
    min(p1.y,p2.y)<=max(p3.y,p4.y) &&
    min(p3.y,p4.y)<=max(p1.y,p2.y))) return -1;/*不相交*/
    int d1= sgn(cross(p1,p2,p3));
    int d2=sgn(cross(p1,p2,p4));
    int d3=sgn(cross(p3,p4,p1));
    int d4=sgn(cross(p3,p4,p2));

    if(d1==0 && d2==0) return 0;/*部分重合*/
    if(d1*d2==0 && d3*d4==0) return 1;/*端点重合*/
    if(d1*d2==0 || d3*d4==0) return 2;/*一端点在另一线段非端点的点上*/
    if(d1*d2<0 && d3*d4<0) return 3;/*线段相交*/
    else return -1;
}
Point point[100];
int tot=0;
int pn,sn;
Seg s1,s2;
bool ping(Seg seg){
    return sgn(seg.e.y-seg.s.y)==0;
}
bool shu(Seg seg){
    return sgn(seg.e.x-seg.s.x)==0;
}
double solve(){
    if(inter(s1,s2)<=0) return 0;
    Point p1,p2,p3,p4;
    p1=s1.s;p2=s1.e;
    p3=s2.s;p4=s2.e;
    double a1,b1,c1,a2,b2,c2;
    a1=p1.y-p2.y;
    b1=p2.x-p1.x;
    c1=p2.x*p1.y-p1.x*p2.y;

    a2=p3.y-p4.y;
    b2=p4.x-p3.x;
    c2=p4.x*p3.y-p3.x*p4.y;

    double x=1.0*(c1*b2-c2*b1)/(a1*b2-a2*b1);
    double y=1.0*(a2*c1-a1*c2)/(a2*b1-a1*b2);
    Point pp1,pp2;
    if(sgn(p1.y-y)>0)  pp1=p1;
    else if(sgn(p2.y-y)>0) pp1=p2;
    else return 0;

    if(sgn(p3.y-y)>0)  pp2=p3;
    else if(sgn(p4.y-y)>0) pp2=p4;
    else return 0;


    if(  pp1.x<=x && pp2.x<=x){
        if(sgn(cross(Point(x,y),pp1,pp2))>=0 &&  pp1.x<=pp2.x) return 0;
        if(sgn(cross(Point(x,y),pp1,pp2))<=0 &&  pp1.x>=pp2.x) return 0;
    }
    if(  pp1.x>=x && pp2.x>=x){

        if(sgn(cross(Point(x,y),pp1,pp2))<=0 &&  pp1.x>=pp2.x) return 0;
        if(sgn(cross(Point(x,y),pp1,pp2))>=0 &&  pp1.x<=pp2.x) return 0;

    }



    double a,b,c;
    double up_y=min(pp1.y,pp2.y);
    if(pp1.y>up_y){
        a=pp1.x-x;
        b=pp1.y-y;
        c=up_y-y;
        pp1=Point(a*c/b+x,up_y);
    }

    if(pp2.y>up_y){
        a=pp2.x-x;
        b=pp2.y-y;
        c=up_y-y;
        pp2=Point(a*c/b+x,up_y);
    }
    return fabs(cross(Point(x,y),pp1,pp2))/2.0;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("aaa","r",stdin);
//freopen("bbb","w",stdout);
#endif
    int T;
    rd(T);
    while(T--){
       int u,v,w,z;
       rdddd(u,v,w,z);
       s1=Seg(Point(u,v),Point(w,z));
       rdddd(u,v,w,z);
       s2=Seg(Point(u,v),Point(w,z));
       printf("%.2f\n",solve());
    }
    return 0;
}