1004. I Conduit!

soj.me/1004

依次排序好k，b，x1，y1

注意斜率不存在的情况

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;

const double MAX=999999;//自定义无穷大斜率

class segment
{
public:
    double k,b,x1,y1,x2,y2;//使用斜截式表示线段
}arr[10001];

bool equal(double a,double b) 
{
    return fabs(a-b)<1e-6;
}

void swap(double &x,double &y)
{
    double z=x;
    x=y;
    y=z;
}

bool cmp(segment s1,segment s2)
{
    if(equal(s1.k,s2.k))
    {
        if(s1.k==MAX)
        {
            if(equal(s1.b,s2.b))
            {
                if(s1.y1==s2.y1)    return s1.y2<s2.y2;
                else return s1.y1<s2.y1;
            }
            else return s1.b<s2.b;
        }
        else if(equal(s1.b,s2.b))
        {
            if(s1.x1==s2.x1)
                return s1.x2<s2.x2;
            else return s1.x1<s2.x1;
        }
        else return s1.b<s2.b;
    }
    else return s1.k<s2.k;
}
int main()
{
    int t;
    while(cin>>t&&t)
    {
        for(int i=0;i<t;i++)
        {
            cin>>arr[i].x1>>arr[i].y1>>arr[i].x2>>arr[i].y2;
            if(arr[i].x1>arr[i].x2||(arr[i].x1==arr[i].x2&&arr[i].y1>arr[i].y2))
            {
                swap(arr[i].x1,arr[i].x2);
                swap(arr[i].y1,arr[i].y2);
            }
            if(arr[i].x1!=arr[i].x2)
            {
                arr[i].k=(arr[i].y2-arr[i].y1)/(arr[i].x2-arr[i].x1);
                arr[i].b=arr[i].y1-arr[i].k*arr[i].x1;
            }
            else
            {
                arr[i].k=MAX;
                arr[i].b=arr[i].x1;
            }
        }
        sort(arr,arr+t,cmp);
        int count=1;
        double x=arr[0].x2,y=arr[0].y2;
        for(int i=1;i<t;i++)
        {
            if(!equal(arr[i].k,arr[i-1].k)||!equal(arr[i].b,arr[i-1].b))
            {
                x=arr[i].x2;
                y=arr[i].y2;
                count++;
            }
            else if((arr[i].k!=MAX&&arr[i].x1>x)||(arr[i].k==MAX&&arr[i].y1>y))
            {
                count++;
                x=arr[i].x2;
                y=arr[i].y2;
            }
            else if((arr[i].k!=MAX&&x<arr[i].x2)||(arr[i].k==MAX&&arr[i].y2>y))
            {
                x=arr[i].x2;
                y=arr[i].y2;
            }
        }
        cout<<count<<endl;
    }
    return 0;
}