poj 2318 TOYS(计算几何 点与线段的关系)

TOYS

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 12015		Accepted: 5792

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

Rocky Mountain 2003

 

开始正经的学计算几何，恩，是的没错～

加油～

题意：给定一个长方形，在里面加上不相交的线，然后给若干点，求这些点落在哪个区域。

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cmath>
 4 #include <cstdlib>
 5 #include <cstring>
 6 #include <math.h>
 7 #include <algorithm>
 8 #include <cctype>
 9 #include <string>
10 #include <map>
11 #define N 500015
12 #define INF 1000000
13 #define ll long long
14 using namespace std;
15 struct Point
16 {
17     int x,y;
18     Point(){}
19     Point(int _x,int _y)
20     {
21         x = _x;y = _y;
22     }
23     Point operator -(const Point &b)const
24     {
25         return Point(x - b.x,y - b.y);
26     }
27     int operator *(const Point &b)const
28     {
29         return x*b.x + y*b.y;
30     }
31     int operator ^(const Point &b)const
32     {
33         return x*b.y - y*b.x;
34     }
35 };
36 struct Line
37 {
38     Point s,e;
39     Line(){}
40     Line(Point _s,Point _e)
41     {
42         s = _s;e = _e;
43     }
44 };
45 
46 int xmult(Point p0,Point p1,Point p2) //计算p0p1 X p0p2
47 {
48     return (p1-p0)^(p2-p0);
49 }
50 const int MAXN = 5050;
51 Line line[MAXN];
52 int ans[MAXN];
53 int main(void)
54 {
55     int n,m,x1,y1,x2,y2,i;
56     int ui,li;
57     int cnt = 0;
58     while(scanf("%d",&n),n)
59     {
60         if(cnt == 0) cnt = 1;
61         else printf("\n");
62         scanf("%d %d %d %d %d",&m,&x1,&y1,&x2,&y2);
63         for(i = 0; i < n; i++)
64         {
65             scanf("%d%d",&ui,&li);
66             line[i] = Line(Point(ui,y1),Point(li,y2));
67         }
68         line[n] = Line(Point(x2,y1),Point(x2,y2));
69 
70         int x,y;
71         Point p;
72         memset(ans,0,sizeof(ans));
73 
74         while(m--)
75         {
76             scanf("%d %d",&x,&y);
77             p = Point(x,y);
78             int l = 0,r = n,tmp = 0;
79             while(l <= r)
80             {
81                 int mid = (l + r)/2;
82                 if(xmult(p,line[mid].s,line[mid].e) < 0)
83                 {
84                     tmp = mid;
85                     r = mid - 1;
86                 }
87                 else
88                     l = mid + 1;
89             }
90             ans[tmp]++;
91         }
92         for(i = 0; i <= n; i++)
93             printf("%d: %d\n",i,ans[i]);
94     }
95     return 0;
96 }

 

转载于:https://www.cnblogs.com/henserlinda/p/4735628.html