TOYS

Calculate the number of toys that land in each bin of a partitioned toy box.
Mom and dad have a problem - their child John never puts his toys away when he is finished playing with them. They gave John a rectangular box to put his toys in, but John is rebellious and obeys his parents by simply throwing his toys into the box. All the toys get mixed up, and it is impossible for John to find his favorite toys.

John’s parents came up with the following idea. They put cardboard partitions into the box. Even if John keeps throwing his toys into the box, at least toys that get thrown into different bins stay separated. The following diagram shows a top view of an example toy box.

For this problem, you are asked to determine how many toys fall into each partition as John throws them into the toy box.
Input
The input file contains one or more problems. The first line of a problem consists of six integers, n m x1 y1 x2 y2. The number of cardboard partitions is n (0 < n <= 5000) and the number of toys is m (0 < m <= 5000). The coordinates of the upper-left corner and the lower-right corner of the box are (x1,y1) and (x2,y2), respectively. The following n lines contain two integers per line, Ui Li, indicating that the ends of the i-th cardboard partition is at the coordinates (Ui,y1) and (Li,y2). You may assume that the cardboard partitions do not intersect each other and that they are specified in sorted order from left to right. The next m lines contain two integers per line, Xj Yj specifying where the j-th toy has landed in the box. The order of the toy locations is random. You may assume that no toy will land exactly on a cardboard partition or outside the boundary of the box. The input is terminated by a line consisting of a single 0.
Output
The output for each problem will be one line for each separate bin in the toy box. For each bin, print its bin number, followed by a colon and one space, followed by the number of toys thrown into that bin. Bins are numbered from 0 (the leftmost bin) to n (the rightmost bin). Separate the output of different problems by a single blank line.
Sample Input

5 6 0 10 60 0
3 1
4 3
6 8
10 10
15 30
1 5
2 1
2 8
5 5
40 10
7 9
4 10 0 10 100 0
20 20
40 40
60 60
80 80
 5 10
15 10
25 10
35 10
45 10
55 10
65 10
75 10
85 10
95 10
0

Sample Output

0: 2
1: 1
2: 1
3: 1
4: 0
5: 1

0: 2
1: 2
2: 2
3: 2
4: 2

Hint
As the example illustrates, toys that fall on the boundary of the box are “in” the box.
题意 ： 求每个区间里的玩具数
这题应该是用叉积做 结果模拟给模拟出来了
大致思路是 判断玩具是否在隔板’/'或隔板‘‘的左边 每次输入一个玩具位置就要判断他在哪个区间 找到之后break 用一个数组存每个区间的玩具数 再输出
关键是如何判断 这里我们用到相似三角形
我们设隔板上面的坐标是(u,y1),下面的坐标是(l,y2),玩具的坐标(x,y),如果隔板是’/'的 那么如果x<l,那么他一定在这个区间里，如果x在[l,u]里，那么我们就要用到相似三角形

三角形CLU和三角形BAU互为相似三角形，那么就满足BU/CU=AB/LC;
即（x-U)/(y-U)=(YA-Y2)/(Y1-Y2),求出YA后和y进行比较 如果y>=YA,那么这个玩具就在这个区间内，隔板为’'的也可以这么推

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int N=1e6+10;
#define  inf 0x3f3f3f3f
double  u[N],l[N];   //隔板位置
int th[N];
int main()
{
    int n,m;
    double x1,y1,x2,y2,s;  //隔板数量 玩具数量 左上角 右下角
    while(~scanf("%d",&n)&&n)
    {
        memset(th,0,sizeof(th));
        scanf("%d %lf %lf %lf %lf",&m,&x1,&y1,&x2,&y2);
        for(int i=0; i<n; i++)
        {
            scanf("%lf %lf",&u[i],&l[i]);   //上  下
        }
        for(int i=0; i<m; i++)
        {
            double  x,y;
            int h=1;
            scanf("%lf %lf",&x,&y);
            for(int j=0; j<n; j++)
            {

                if(x<u[j]&&l[j]<=u[j])   //   在/的左边
                {
                    if(x<=l[j])
                    {
                        th[j]++;
                        h=0;
                        break;
                    }
                    s=(x-l[j])*1.0/(u[j]-l[j])*(y1-y2)+y2;
                    if(y>=s)
                    {
                        th[j]++;
                        h=0;
                        break;
                    }

                }
                if(x<l[j]&&l[j]>u[j])    //在  \的左边
                {
                    if(x<=u[j])
                    {
                        th[j]++;
                        h=0;
                        break;
                    }
                    s=(l[j]-x)*1.0/(l[j]-u[j])*(y1-y2)+y2;
                    if(y<=s)
                    {
                        th[j]++;
                        h=0;
                        break;
                    }
                }
            }
            if(h)  //如果以上情况都没有  可能是最后面 有空格
                th[n]++;
        }
      //  printf("Box\n");
        //sort(th,th+1+n);    //每个分区所放的玩具数
        for(int i=0; i<=n; i++)
            printf("%d: %d\n",i,th[i]);
            printf("\n");
        /* int k=0;
         for(int i=1; i<=n; i++)
         {
             k=0;
             for(int j=0;j<=n;j++)    //记录分区玩具数等于i的分区数
             {
                if(th[j]==i)
                {
                    k++;
                }
             }
             if(!k)
                 printf("%d: %d\n",i,k);
         }
         printf("\n");*/
    }
    return 0;
}