zoukankan      html  css  js  c++  java
  • POJ2318(KB13-A 计算几何)

    TOYS

    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 16222   Accepted: 7779

    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.

    Source

     
    对于每个玩具,二分找到其左边第一条直线,由此得到对应区域。
     1 //2017-08-30
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <iostream>
     5 #include <algorithm>
     6 
     7 using namespace std;
     8 
     9 const int N = 5010;
    10 
    11 struct Point{
    12     int x, y;
    13     Point(){}
    14     Point(int _x, int _y):x(_x), y(_y){}
    15     //a-b 表示向量 ba
    16     Point operator- (const Point &b) const {
    17         return Point(x-b.x, y-b.y);
    18     }
    19     //向量叉积
    20     int operator* (const Point &b) const {
    21         return x*b.y - y*b.x;
    22     }
    23 }A, B;
    24 
    25 int ans[N], U[N], L[N];
    26 int n, m;
    27 
    28 bool check(int id, int x, int y){
    29     Point a(L[id], B.y);
    30     Point b(U[id], A.y);
    31     Point c(x, y);
    32     //令I = 向量ab 叉乘 向量 bc,若I为正,点c在向量ab的左侧(沿向量方向看);为负则在右侧
    33     return ((c-a)*(b-a)) > 0;
    34 }
    35 
    36 int get_position(int x, int y){
    37     int l = 0, r = n+1, mid, ans;
    38     while(l <= r){
    39         mid = (l+r)>>1;
    40         if(check(mid, x, y)){
    41             ans = mid;
    42             l = mid+1;
    43         }else r = mid-1;
    44     }
    45     return ans;
    46 }
    47 
    48 int main()
    49 {
    50     std::ios::sync_with_stdio(false);
    51     //freopen("inputA.txt", "r", stdin);
    52     while(cin>>n && n){
    53         cin>>m>>A.x>>A.y>>B.x>>B.y;
    54         U[0] = L[0] = A.x;
    55         U[n+1] = L[n+1] = B.x;
    56         for(int i = 1; i <= n; i++)
    57           cin>>U[i]>>L[i];
    58         memset(ans, 0, sizeof(ans));
    59         int x, y;
    60         for(int i = 0; i < m; i++){
    61             cin>>x>>y;
    62             ans[get_position(x, y)]++;
    63         }
    64         for(int i = 0; i <= n; i++)
    65           cout<<i<<": "<<ans[i]<<endl;
    66         cout<<endl;
    67     }
    68 
    69     return 0;
    70 }
  • 相关阅读:
    POJ 3255 Roadblocks
    KMP算法的前缀next数组最通俗的解释
    HDU 1829 A Bug's Life
    HDU 1879 继续畅通工程
    课程设计:学生管理系统(c++)
    HDU 1016 Prime Ring Problem
    HDU 4310 Hero
    素数筛选法<单向链表实现>
    【未完】训练赛20190304:KMP+树状数组+线段树+优先队列
    畅通工程:并查集入门裸题
  • 原文地址:https://www.cnblogs.com/Penn000/p/7452248.html
Copyright © 2011-2022 走看看