zoukankan      html  css  js  c++  java
  • POJ-2398 Toy Storage

    Toy Storage

    Time Limit: 1000MS   Memory Limit: 65536K

    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的题一样的,只是要排序一下,并且输出方式也不一样

    代码

    #include<iostream>
    #include<stdio.h>
    #include<string.h>
    #include<math.h>
    #include<algorithm>
    using namespace std;
    const int maxn = 5000+50;
    int ans[maxn];
    struct Point
    {
        int x,y;
        Point(){}
        Point(int _x,int _y)
        {
            x = _x;y = _y;
        }
        Point operator -(const Point &b)const
        {
            return Point(x - b.x,y - b.y);
        }
        int operator *(const Point &b)const
        {
            return x*b.x + y*b.y;
        }
        int operator ^(const Point &b)const
        {
            return x*b.y - y*b.x;
        }
    };
    struct Line
    {
        Point s,e;
        Line(){}
        Line(Point _s,Point _e)
        {
            s = _s;e = _e;
        }
        bool operator < (const Line &rhs) const{
           if(s.x==rhs.s.x) return e.x<rhs.e.x;
           return s.x<rhs.s.x;
        }
    };
    
    int xmult(Point p0,Point p1,Point p2)
    {
        return (p1-p0)^(p2-p0);
    }
    Line line[maxn];
    int num[maxn];
    int main()
    {
        int n,m,x1,x2,y1,y2;
        while(scanf("%d",&n)==1&&n){
            scanf("%d%d%d%d%d",&m,&x1,&y1,&x2,&y2);
            int Ui,Li;
            for(int i=0;i<n;i++){
                scanf("%d%d",&Ui,&Li);
                line[i]=Line(Point(Ui,y1),Point(Li,y2));
            }
            line[n]=Line(Point(x2,y1),Point(x2,y2));
            sort(line,line+n+1);
            int x,y;
            Point p;
            memset(ans,0,sizeof(ans));
            while(m--){
                scanf("%d %d",&x,&y);
                p=Point(x,y);
                int l=0,r=n;
                int tmp;
                while(l<=r){
                    int mid=(l+r)/2;
                    if(xmult(p,line[mid].s,line[mid].e)<0){
                        tmp=mid;
                        r=mid-1;
                    }
                    else l=mid+1;
                }
                ans[tmp]++;
            }
            printf("Box
    ");
            memset(num,0,sizeof(num));
            for(int i=0;i<=n;i++)
                if(ans[i]>0) num[ans[i]]++;
            for(int i=0;i<=n;i++)
                if(num[i]>0) printf("%d: %d
    ",i,num[i]);
        }
        return 0;
    }
  • 相关阅读:
    沙盒配置好的测试
    云端存储的实现:云存储1
    演职人员名单MobileMenuList
    关于GitHub的朋友的NE Game
    到了冲刺阶段
    云存储的配置3
    刚才花了1$赞助了那位伙计
    我知道这对自己是个积累的过程,很好,我成长的很快
    煎熬过后终于有一刻释怀
    空白不曾停止。。。
  • 原文地址:https://www.cnblogs.com/wangdongkai/p/5569574.html
Copyright © 2011-2022 走看看