ACM-计算几何之Toy Storage——poj2398

Toy Storage

题目：http://poj.org/problem?id=2398

Description

Mom and dad have a problem: their child, Reza, never puts his toys away when he is finished playing with them. They gave Reza a rectangular box to put his toys in. Unfortunately, Reza 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 Reza to find his favorite toys anymore.
Reza's parents came up with the following idea. They put cardboard partitions into the box. Even if Reza keeps throwing his toys into the box, at least toys that get thrown into different partitions stay separate. The box looks like this from the top:



We want for each positive integer t, such that there exists a partition with t toys, determine how many partitions have t, toys.

Input

The input consists of a number of cases. The first line consists of six integers n, m, x1, y1, x2, y2. The number of cardboards to form the partitions is n (0 < n <= 1000) and the number of toys is given in m (0 < m <= 1000). 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 each consists of two integers Ui Li, indicating that the ends of the ith cardboard is at the coordinates (Ui, y1) and (Li, y2). You may assume that the cardboards do not intersect with each other. The next m lines each consists of two integers Xi Yi specifying where the ith toy has landed in the box. You may assume that no toy will land on a cardboard.

A line consisting of a single 0 terminates the input.

Output

For each box, first provide a header stating "Box" on a line of its own. After that, there will be one line of output per count (t > 0) of toys in a partition. The value t will be followed by a colon and a space, followed the number of partitions containing t toys. Output will be sorted in ascending order of t for each box.

Sample Input

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

Sample Output
Box
2: 5
Box
1: 4

2: 1

题目2318的进阶题，

给一个矩形，用N条线段将矩形分区域，撒一堆点，找每个区域的点个数有多少。

这次给的线段没有按照顺序，所以要对线段排序。

输出也有变化，输出的是  点的个数为x的区域个数有多少个

Box

点的个数x：拥有x个点的区域个数

当然x不能等于0

做法，参照2318就可以：http://blog.csdn.net/lttree/article/details/23548585

// 2398#include <iostream>#include <string.h>#include <algorithm>using namespace std;struct Dian{    int x,y;};struct Line{    Dian a,b;}line[1001];// maxx用来记录所有区域中，点个数最大为多少个int n,m,maxx,total[1001];bool vis[1001];//所需输入的只是横坐标，所以，只需要比较横坐标大小bool cmp(Line k1,Line k2){    return k1.a.x<k2.a.x;}// 求叉积int chaji(Dian p0,Dian p1,Dian p2){    return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);}void judge(Dian d){    int i;    // 从第一条线向后遍历，如果点在该线左面，则该下标total++    for(i=0;i<n;++i)    {        if(chaji(line[i].b,d,line[i].a)>0)  continue;        else        {            ++total[i];            if(total[i]>maxx)   maxx=total[i];            return;        }    }    // 找到最后都没找到，就是在最后一个区域    ++total[n];    if(total[i]>maxx)   maxx=total[i];    return;}// 查找所有区域中，点个数为h的区域个数int find_i(int h){    int i,sum=0;    for(i=0;i<=n;++i)    {        if(vis[i] || !total[i] || total[i]!=h) continue;        vis[i]=1;        ++sum;    }    return sum;}int main(){    int i,num;    Dian left_up,right_low,temp;    while(cin>>n && n)    {        cin>>m>>left_up.x>>left_up.y>>right_low.x>>right_low.y;        memset(total,0,sizeof(total));        memset(vis,0,sizeof(vis));                for(i=0;i<n;++i)        {            cin>>line[i].a.x>>line[i].b.x;            line[i].a.y=left_up.y;            line[i].b.y=right_low.y;        }        // 线段顺序是无序的，需要排序        sort(line,line+n,cmp);        maxx=-1;        for(i=0;i<m;++i)        {            cin>>temp.x>>temp.y;            judge(temp);        }        // 输出        cout<<"Box"<<endl;        for(i=1;i<=maxx;++i)        {            num=0;            num=find_i(i);            if(!num)    continue;            cout<<i<<": "<<num<<endl;        }    }    return 0;}