大一第十三周训练D题 数学题
题目:
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.
输入:
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.
输出:
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.
样例:
输入:
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
输出:
0: 2
1: 1
2: 1
3: 1
4: 0
5: 1
0: 2
1: 2
2: 2
3: 2
4: 2
补充:
As the example illustrates, toys that fall on the boundary of the box are “in” the box.
——————————————————————————————————————
题意:
题意就是给你一个箱子的左上角和右下角的坐标,接着给你n个隔板的位置和m个玩具的位置,让你求由n个隔板分成的n+1个空间中玩具的数量。
思路:
就是一个数学题,让你确定点与直线的位置关系;因为隔板是竖着的,所以要考虑斜率不存在的情况,所以直接用x=my+n。
——————————————————————————————————————
没啥可讲的,上代码吧:
//因为斜率可能不存在,用x=my+n;
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;
double x[100010],y[100010];
int e[100010];
int main()
{
double x1,y1,x2,y2,a,b;
int i,j,n,m;
while(~scanf("%d",&n)&&n)
{
scanf("%d%lf%lf%lf%lf",&m,&x1,&y1,&x2,&y2);
memset(e,0,sizeof(e));
for(i=0;i<n;i++)
{
scanf("%lf%lf",&a,&b);
x[i]=(b-a)/(y2-y1);
y[i]=a-x[i]*y1;
}
for(i=1;i<=m;i++)
{
scanf("%lf%lf",&a,&b);
if(a<x1||a>x2)
continue;
for(j=0;j<n;j++)
{
if((x[j]*b+y[j])>a)
{
e[j]++;
break;
}
}
if(j==n)
e[n]++;
}
for(i=0;i<=n;i++)
{
printf("%d: %d\n",i,e[i]);
}
printf("\n");
}
return 0;
}