原题传送门:http://poj.org/problem?id=2318
博主的中文题面(如果要交付评测的话请仔细阅读提示):
https://www.luogu.org/problemnew/show/T22894
Toy
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.
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.
题目大意
给定多个分区和点的信息,求每个分区中点的数量
题解
一道计算几何入门练手题,判断点是否在区间中可以对两边的线段做叉积,如果叉出来的结果是异号的,即可判断点在区间中。因为题目给的区间是有序的,所以可以二分查找每个点的区间(然而POJ上不二分也可以过,感兴趣的同学可以去博主的题面)。
这道题主要就是练习一下最基本的计算几何运算和代码。
代码
#include<cstdio>
#include<cstring>
using namespace std;
int n,m,x1,x2,y1,y2;
struct pt{int x,y;};
struct li{pt f,t;};
pt operator - (pt a,pt b){return (pt){a.x-b.x,a.y-b.y};}
int operator * (pt a,pt b){return a.x*b.y-a.y*b.x;}
bool alb(pt a,pt b){return a*b<0;}
li bod[5005];
int ans[5005];
int area(int a,pt b)
{
int s1=(bod[a].f-b)*(bod[a].t-b);
int s2=(bod[a+1].f-b)*(bod[a+1].t-b);
if(s1>0&&s2>0) return -1;
if(s1<0&&s2<0) return 1;
return 0;
}
void in()
{
scanf("%d%d%d%d%d",&m,&x1,&y1,&x2,&y2);
bod[0]=(li){(pt){x1,y1},(pt){x1,y2}};
bod[n+1]=(li){(pt){x2,y1},(pt){x2,y2}};
for(int i=1,a,b;i<=n;++i)
scanf("%d%d",&a,&b),bod[i]=(li){(pt){a,y1},(pt){b,y2}};
}
int find(int le,int ri,pt x)
{
int mid=(le+ri)>>1;
int p=area(mid,x);
if(!p) return mid;
if(p<0) return find(mid+1,ri,x);
return find(le,mid,x);
}
void ac()
{
pt hh;
for(int i=1;i<=m;++i)
scanf("%d%d",&hh.x,&hh.y),ans[find(0,n,hh)]++;
for(int i=0;i<=n;++i)
printf("%d: %d\n",i,ans[i]);
putchar(10);
memset(ans,0,sizeof(ans));
memset(bod,0,sizeof(bod));
}
int main()
{
while(scanf("%d",&n)==1&&n)
in(),ac();
return 0;
}