POJ 2318 TOYS
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.
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.
![](http://poj.org/images/2318_1.jpg)
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.
题解:
人生第一道计算几何哈,1A很棒的.
简单题写复杂了 : 二分所属box,判断叉鸡(积)是否相同即可
1 #include <algorithm> 2 #include <iostream> 3 #include <cstdlib> 4 #include <cstring> 5 #include <cstdio> 6 #include <cmath> 7 using namespace std; 8 const int N=5005; 9 struct P{ 10 int x,y; 11 P(){} 12 P(int _x,int _y){x=_x;y=_y;} 13 P operator -(const P a)const{ 14 return P(x-a.x,y-a.y); 15 } 16 int operator *(const P a)const{ 17 return x*a.y-y*a.x; 18 } 19 }; 20 int xx,yy,m,n,x2,y2,ans[N],U[N],L[N]; 21 int check(int i,int x,int y){ 22 P p1=P(yy-y2,U[i]-L[i]),p2=P(yy-y2,U[i+1]-L[i+1]); 23 P p3=P(y-yy,x-U[i]),p4=P(y-yy,x-U[i+1]); 24 int t1=p1*p3,t2=p2*p4; 25 if((t1>0)!=(t2>0))return 2; 26 if(t1>=0)return 1; 27 return 0; 28 } 29 void sbxy(int x,int y){ 30 int l=0,r=n,mid,tmp,ret; 31 while(l<=r){ 32 mid=(l+r)>>1; 33 tmp=check(mid,x,y); 34 if(tmp==2){ 35 ret=mid;break; 36 } 37 if(tmp)l=mid+1; 38 else r=mid-1; 39 } 40 ans[ret]++; 41 } 42 void work(){ 43 scanf("%d%d%d%d%d",&m,&xx,&yy,&x2,&y2); 44 ans[0]=0; 45 for(int i=1;i<=n;i++){ 46 scanf("%d%d",&U[i],&L[i]); 47 ans[i]=0; 48 } 49 U[n+1]=x2;L[n+1]=x2;U[0]=xx;L[0]=xx; 50 int tx,ty; 51 for(int i=1;i<=m;i++){ 52 scanf("%d%d",&tx,&ty); 53 sbxy(tx,ty); 54 } 55 for(int i=0;i<=n;i++){ 56 printf("%d: %d\n",i,ans[i]); 57 } 58 printf("\n"); 59 } 60 int main() 61 { 62 while(~scanf("%d",&n)){ 63 if(n==0)break; 64 work(); 65 } 66 return 0; 67 }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 开发中对象命名的一点思考
· .NET Core内存结构体系(Windows环境)底层原理浅谈
· C# 深度学习:对抗生成网络(GAN)训练头像生成模型
· .NET 适配 HarmonyOS 进展
· .NET 进程 stackoverflow异常后,还可以接收 TCP 连接请求吗?
· 本地部署 DeepSeek:小白也能轻松搞定!
· 基于DeepSeek R1 满血版大模型的个人知识库,回答都源自对你专属文件的深度学习。
· 在缓慢中沉淀,在挑战中重生!2024个人总结!
· 如何给本地部署的DeepSeek投喂数据,让他更懂你
· 大人,时代变了! 赶快把自有业务的本地AI“模型”训练起来!