给定一个如上的长方形箱子,中间有n条线段,将其分为n+1个区域,给定m个玩具的坐标,统计每个区域中的玩具个数。
解答:对每个玩具,二分线段下标,判断在线段左边还是右边,找到之后进行统计即可
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
struct Point {
int x, y;
};
struct Line {
Point a, b;
} line[5005];
int cnt[5005];
int Multi(Point p1, Point p2, Point p0) {
return (p1.x - p0.x) * (p2.y - p0.y) - (p2.x - p0.x) * (p1.y - p0.y);
}
void BSearch(Point a, int n) {
int l, r, mid;
l = 0; r = n-1;
while (l < r) {
mid = (l + r) >> 1;
if (Multi(a, line[mid].a, line[mid].b) > 0) l = mid + 1;
else r = mid;
}
if (Multi(a, line[l].a, line[l].b) < 0) cnt[l]++;
else cnt[l+1]++;
}
int main()
{
int n, m, x1, y1, x2, y2;
int i, t1, t2;
Point a;
while (scanf ("%d", &n) && n) {
scanf ("%d%d%d%d%d", &m, &x1, &y1, &x2, &y2);
for (i = 0; i < n; i++) {
scanf ("%d%d", &t1, &t2);
line[i].a.x = t1;
line[i].a.y = y1;
line[i].b.x = t2;
line[i].b.y = y2;
}
memset(cnt, 0, sizeof (cnt));
for (i = 0; i < m; i++) {
scanf ("%d%d", &a.x, &a.y);
BSearch(a, n);
}
for (i = 0; i <= n; i++)
printf ("%d: %d\n", i, cnt[i]);
printf("\n");
}
return 0;
}