POJ 2398 Toy Storage

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5920		Accepted: 3545

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

Source

Tehran 2003 Preliminary

[Submit]   [Go Back]   [Status]   [Discuss]

Home Page   Go Back  To top

 

这题和上上道题的思路和算法都是一样的，

只不过需要改一下输出格式，

而且这道题不保证读入数据是有序的，

所以需要排一下序

 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN=300001;
inline void read(int &n)
{
    char c=getchar();bool flag=0;n=0;
    while(c<'0'||c>'9')    c=='-'?flag=1,c=getchar():c=getchar();
    while(c>='0'&&c<='9')    n=n*10+(c-48),c=getchar();if(flag==1)n=-n;
}
int n,m,x1,yy1,x2,y2;
struct node 
{
    int x,y;
}point[MAXN];
struct Line
{
    node a,b;
}line[MAXN];
int cross(node a,node b,node c)
{return (c.x-a.x)*(c.y-b.y)-(c.x-b.x)*(c.y-a.y);}
int ans[MAXN];
int happen[MAXN];
void calc(int num)
{
    int l=0,r=n-1;
    while(l<r)
    {
        int mid=(l+r)>>1;
        if(cross(point[num],line[mid].a,line[mid].b)>0) l=mid+1;
        else r=mid;
    }
    if(cross(point[num],line[l].a,line[l].b)<0)    ans[l]++;
    else ans[l+1]++;
}
bool cmp(const Line &p,const Line &q)  
{  return min(p.a.x,p.b.x)<min(q.a.x,q.b.x)||((min(p.a.x,p.b.x)==min(q.a.x,q.b.x))&&(max(p.a.x,p.b.x)<max(q.a.x,q.b.x)));  }  
int main()
{
    while(scanf("%d",&n)&&n)
    {
        scanf("%d%d%d%d%d",&m,&x1,&yy1,&x2,&y2);
        for(int i=0;i<n;i++)
        {
            int p,q;read(p);read(q);
            line[i].a.x=p;    line[i].a.y=yy1;
            line[i].b.x=q;    line[i].b.y=y2;
        }
        sort(line,line+n,cmp);
        memset(ans,0,sizeof(ans));    memset(happen,0,sizeof(happen));
        for(int i=0;i<m;i++)
        {
            int p,q;read(p);read(q);
            point[i].x=p;    point[i].y=q;
        }
        for(int i=0;i<m;i++)    calc(i);
        for(int i=0;i<=n;i++)    happen[ans[i]]++;
        printf("Box\n");
        for(int i=1;i<=n;i++)
            if(happen[i]>0)    printf("%d: %d\n",i,happen[i]);
        
    }    
    return 0;
}