poj 2398

计算几何

水题一道，没有刻意的去卡时间和内存。

可以用二分做查找优化，由于数据范围太小。所以暴力还是查找还是很快的。

注意给出的数据不是有序的，需要排序。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;


struct point {
double x1,y1,x2,y2;
int sum;
};
point data[1100]={};
int n,m;
double x1,x2,y1,y2;


double cha(point a,double x,double y) {      // x - a.x1,y - a.y1      x-a.x2,y-a.y2;
return (x - a.x1)*(y-a.y2) - (y-a.y1)*(x-a.x2);
}
bool cmp(point a,point b) {
return a.x1 < b.x1;
}
int main() {
while(scanf("%d",&n),n) {
memset(data,0,sizeof(data));
scanf("%d %lf %lf %lf %lf",&m,&x1,&y1,&x2,&y2);
data[0].x1 = x1,data[0].y1 = y1;data[0].x2 = x1;data[0].y2 = y2;
data[n+1].x1 = x2,data[n+1].x2 = x2;data[n+1].y1 = y1; data[n+1].y2 = y2;
for(int i = 1; i <= n; i++) {
scanf("%lf %lf",&data[i].x1,&data[i].x2);
data[i].y1 = y1;data[i].y2 = y2;
}
sort(data,data+n+1,cmp);
for(int i = 0;  i < m; i++) {
double x,y;
scanf("%lf %lf",&x,&y);
for(int j = 0; j <= n+1; j++)
 if(cha(data[j],x,y) < 0) {
 data[j].sum++;
 break;
 }
}
printf("Box\n");
int sum = 0;
for(int i = 1; sum < m; i++) {
int count = 0;
for(int j = 0; j < n + 2; j++)
 if(data[j].sum == i)
count++;
sum += count*i;
if(count != 0)
 printf("%d: %d\n",i,count);
}
}
return 0;
}