TOYS
Time Limit: 2000MS Memory Limit: 65536K
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.
题意:
给出一个盒子用直线分成不同的区域,在给你玩具的位置(点),判断这个点在那个位置。
思路:
很明显的几何题目,如果在某个区域里面就会有与前面一条直线的叉积为正后面一天为负,这样就可以暴力了(应该是可以过的,本人是没试过的),但是为了更快,可以用二分,为负数就往左找,为正数就往右边找。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
const int maxn = 5010;
const double eps = 1e-10;
struct P {
int x, y;
P () {}
P(int x, int y) : x(x), y(y) {}
P operator - (P p) {
return P(x - p.x, y - p.y);
}
int det(P p) {
return x * p.y - y * p.x;
}
};
P p[maxn], q[maxn], point;
int check(int mid) {
return (q[mid] - p[mid]).det(point - p[mid]);
}
int main() {
int n, m, x1, x2, y1, y2;
int book[maxn] = {false};
while (scanf("%d", &n) != EOF && n) {
memset(book, 0, sizeof(book));
scanf("%d %d %d %d %d", &m, &x1, &y1, &x2, &y2);
for (int i = 1; i <= n; i++) {
scanf("%d %d", &p[i].x, &q[i].x);
p[i].y = y1;
q[i].y = y2;
}
while (m--) {
scanf("%d %d", &point.x, &point.y);
int l = 0, r = n, tmp = 0;
while (r >= l) {
int mid = (l + r) >> 1;
if (check(mid) >= 0) l = mid + 1;
else r = mid - 1;
}
book[r]++;
}
for (int i = 0; i <= n; i++) {
printf("%d: %d\n", i, book[i]);
}
printf("\n");
}
return 0;
}