poj2318(计算几何)

时间：2014-08-20 20:49:32 阅读：286 评论：0 收藏：0 [点我收藏+]

标签：des style blog http color os io strong

　1.题目（theme）　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　

　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　TOYS

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 10488		Accepted: 5031

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. bubuko.com,布布扣

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

Hint

As the example illustrates, toys that fall on the boundary of the box are "in" the box.

2.题目大意（The meaning of the questions）

　　一个格子放置玩具，用隔板分开，输入隔板数n，玩具数m，格子的左上角和右下角的坐标x1,y1,x2,y2(用来表示格子大小)，然后输入n个隔板的位置ui和Li，坐标为（上面（ui,y1）,下面（Li,y2）），m个玩具的坐标x和y；

3.解题方法（solution）

　　1.找到一个i，使得Li>x;然后用叉积判断在那边，然后决定向左还是向右移，直到边界条件。

 1 #include <iostream>
 2 #include <cmath>
 3 #include <string.h>
 4 #include <cstdio>
 5 using namespace std;
 6 int a[5005],b[5005],c[5005];
 7 int main()
 8 {
 9     int n,m,x1,y1,x2,y2,i,j,k,x,y,l1,l2,l3,l4;
10     while (scanf("%d%d%d%d%d%d",&n,&m,&x1,&y1,&x2,&y2)==6){
11         for (i=0;i<5005;i++){
12             c[i]=0;
13         }
14         b[n]=x2;a[n]=y2;
15         for (i=0;i<n;i++){
16             scanf("%d%d",&a[i],&b[i]);
17         }
18         for (i=0;i<m;i++){
19             scanf("%d%d",&x,&y);
20             j=0;
21             while (b[j]<x&&j<n){
22                 j++;
23             }
24             l1=a[j]-x;
25             l2=y1-y;
26             l3=b[j]-x;
27             l4=y2-y;
28             if (l1*l4-l2*l3>0){
29                 while (l1*l4-l2*l3>0&&j<n){
30                     j++;
31                     l1=a[j]-x;
32                     l2=y1-y;
33                     l3=b[j]-x;
34                     l4=y2-y;
35                 }
36                 c[j]++;
37             }else {
38                 while (l1*l4-l2*l3<0){
39                     j--;
40                     l1=a[j]-x;
41                     l2=y1-y;
42                     l3=b[j]-x;
43                     l4=y2-y;
44                 }
45                 c[j+1]++;
46             }
47         }
48         for (i=0;i<=n;i++){
49             printf("%d: %d\n",i,c[i]);
50         }
51         printf("\n");
52     }
53     return 0;
54 }

　　2.二分加叉积：

poj2318(计算几何),布布扣,bubuko.com

poj2318(计算几何)

标签：des style blog http color os io strong

原文地址：http://www.cnblogs.com/nwpuzzh/p/3925403.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行