poj 2318 TOYS

题目地址：poj2318

统计每个隔间的个数

先想着暴力，对每个隔板，扫描所有的点，看是否在左边，然后sum[i]-sum[i-1]  就是所要求的结果。

TLE，于是加一个标记位，done数组，那么第一次被找到发现在左边done[i]=1;复杂度降低5000倍。

代码：

#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<cstring>
const double eps=1e-8;


using namespace std;


struct Point{
    double x;
    double y;
    Point(double x=0,double y=0):x(x),y(y){}
    void operator<<(Point &A) {cout<<A.x<<' '<<A.y<<endl;}
};

int dcmp(double x)  {return (x>eps)-(x<-eps); }

typedef  Point  Vector;

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 p) { return Vector(A.x*p,A.y*p);  }

Vector  operator /(Vector A,double p) {return Vector(A.x/p,A.y/p);}

// ps  cout

ostream &operator<<(ostream & out,Point & P) { out<<P.x<<' '<<P.y<<endl; return out;}

bool  operator< (const Point &A,const Point &B) { return A.x<B.x||(A.x==B.x&&A.y<B.y); }

bool  operator== ( const Point &A,const Point &B) { return dcmp(A.x-B.x)==0&&dcmp(A.y-B.y)==0;}


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-B.x*A.y; }

double  Length(Vector A)  { return sqrt(Dot(A, A));}


double  Angle(Vector A,Vector B) {return acos(Dot(A,B)/Length(A)/Length(B));}

double  Area2(Point A,Point B,Point C ) {return Cross(B-A, C-A);}

Vector Rotate(Vector A,double rad) { return Vector(A.x*cos(rad)-A.y*sin(rad),A.x*sin(rad)+A.y*cos(rad));}
Vector Normal(Vector A) {double L=Length(A);return Vector(-A.y/L,A.x/L);}

Point GetLineIntersection(Point P,Vector v,Point Q,Vector w)
{
    Vector u=P-Q;
    double t=Cross(w, u)/Cross(v,w);
    return P+v*t;
    
}

double DistanceToLine(Point P,Point A,Point B)
{
    Vector v1=P-A; Vector v2=B-A;
    return fabs(Cross(v1,v2))/Length(v2);
    
}

double DistanceToSegment(Point P,Point A,Point B)
{
    if(A==B)  return Length(P-A);
    
    Vector v1=B-A;
    Vector v2=P-A;
    Vector v3=P-B;
    
    if(dcmp(Dot(v1,v2))==-1)    return  Length(v2);
    else if(Dot(v1,v3)>0)    return Length(v3);
    
    else return DistanceToLine(P, A, B);
    
}

Point GetLineProjection(Point P,Point A,Point B)
{
    Vector v=B-A;
    Vector v1=P-A;
    double t=Dot(v,v1)/Dot(v,v);
    
    return  A+v*t;
}

bool  SegmentProperIntersection(Point a1,Point a2,Point b1,Point b2)
{
    double c1=Cross(b1-a1, a2-a1);
    double c2=Cross(b2-a1, a2-a1);
    double c3=Cross(a1-b1, b2-b1);
    double c4=Cross(a2-b1, b2-b1);
    
        return dcmp(c1)*dcmp(c2)<0&&dcmp(c3)*dcmp(c4)<0 ;
    
}

bool  OnSegment(Point P,Point A,Point B)
{
    return dcmp(Cross(P-A, P-B))==0&&dcmp(Dot(P-A,P-B))<=0;
}

double PolygonArea(Point *p,int n)
{
    double area=0;
    
    for(int i=1;i<n-1;i++)
    {
        area+=Cross(p[i]-p[0], p[i+1]-p[0]);
        
    }
    return area/2;
    
}

Point  read_point()
{
    Point P;
    scanf("%lf%lf",&P.x,&P.y);
    return  P;
}


Point a[5010];
Point b[5010];

Point p[5010];

bool done[5010];

int  sum[5010];
//int  cnt[5010];
int main()
{
    int n,m;
    bool first=1;
    
    while(cin>>n)
    {
        if(!n) break;
        cin>>m;
        
        if(!first)  puts("");
        if(first)  first=0;
    double x1,y1,x2,y2;
    cin>>x1>>y1>>x2>>y2;
    
    
    double  temp1,temp2;
    
    for(int i=0;i<n;i++)
    {
        scanf("%lf%lf",&temp1,&temp2);
        a[i]=Point(temp1,y1);
        b[i]=Point(temp2,y2);
    }
    
  
    
    for(int i=0;i<m;i++)
    {
        p[i]=read_point();
    }
    
    memset(sum, 0, sizeof(sum));
        memset(done, 0, sizeof(done));
    
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            if(done[j]) continue;
           if(dcmp(Cross(a[i]-b[i],p[j]-b[i]))>0)
           {
               sum[i]++;
               done[j]=1;
           }
        }
    }
//    cnt[0]=sum[0];
//    
//    cnt[n]=m-sum[n-1];
//    
//    
//    for(int i=1;i<n;i++)
//    {
//        cnt[i]=sum[i]-sum[i-1];
//        
//    }
    
        int  remain=0;
        for(int i=0;i<n;i++)
        {
            remain+=sum[i];
        }
        
        sum[n]=m-remain;
    for(int i=0;i<=n;i++)
    {
        printf("%d: %d\n",i,sum[i]);
    }
    
    
    
    }
}