zoukankan      html  css  js  c++  java
  • POJ 2318 TOYS

    Description

    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.
     
    //Poj 2318 toys
    
    //二分+叉积判断点和直线关系 
    
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<cmath>
    using namespace std;
    
    const int N=5e3+5;
    
    int n,m;
    double X,Y,XX,YY;
    int ans[N];
    struct Line
    {
        double x,y,xx,yy;
    }line[N];
    
    bool judge(int x,int y,int id)
    {
        double t=(line[id].x-x)*(line[id].yy-y)-(line[id].xx-x)*(line[id].y-y);
        if(t>0)    //右边 
            return 0;
        return 1;    //左边 
    }
    
    void search(int tx,int ty,int n)
    {
        int l=1,r=n,mid;
        while(l<=r)
        {
            mid=l+r>>1;
            if(judge(tx,ty,mid))
                l=mid+1;
            else
                r=mid-1;
        }
        ++ans[l];
    }
    
    int main()
    {
        while(scanf("%d",&n))
        {
            if(n==0)
                break;
            scanf("%d",&m);
            scanf("%lf%lf%lf%lf",&X,&Y,&XX,&YY);
            for(int i=1;i<=n;++i)
            {
                scanf("%lf%lf",line[i].x,line[i].xx);
                line[i].y=Y,line[i].yy=YY;
            }
            for(int i=1;i<=m;++i)
            {
                int tx,ty;
                scanf("%d%d",&tx,&ty);
                search(tx,ty,N);
            }
            for(int i=1;i<=n;++i)
                printf("%d: %d
    ",i-1,ans[i]);
                puts("");
        }
        return 0;
    }
  • 相关阅读:
    JSTL EL 详解
    什么是JavaBean
    easy.jsp出现According to TLD or attribute directive in tag file, attribute value does not accept any expressions
    搭建sendmail
    系统运维工程师之路
    centos7 搭建安装zabbix3.0服务端实例(一)
    单例模式
    cassandra-压缩策略
    cassandra的坑-windows平台压缩策略
    Quick Sort
  • 原文地址:https://www.cnblogs.com/lovewhy/p/8982737.html
Copyright © 2011-2022 走看看