TOYS - POJ 2318 叉积
来源:互联网 发布:网络出版有什么用 编辑:程序博客网 时间:2024/05/22 08:11
TOYS
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11642 Accepted: 5615
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.
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 03 14 36 810 1015 301 52 12 85 540 107 94 10 0 10 100 020 2040 4060 6080 80 5 1015 1025 1035 1045 1055 1065 1075 1085 1095 100
Sample Output
0: 21: 12: 13: 14: 05: 10: 21: 22: 23: 24: 2
题意:将一个矩形分成一些格子,然后给你一些点,判断每个格子内有多少点。
思路:叉积判断点在直线的哪一端,然后二分即可。
AC代码如下:
#include<cstdio>#include<cstring>using namespace std;struct Point{ int x,y; Point(int x=0,int y=0):x(x),y(y){}}p[5010][2];typedef Point Vector;Vector operator + (Vector A,Vector B){return Vector (A.x+B.x,A.y+B.y);}Vector operator - (Vector A,Vector B){return Vector (A.x-B.x,A.y-B.y);}int t,n,m,num[5010],x1,y1,x2,y2;int Cross(Point a,Point b){ printf(""); return a.x*b.y-a.y*b.x;}Point A;int find(){ int l=0,r=n,mid; while(l<r) { mid=(l+r)/2; if(Cross(p[mid][0]-p[mid][1],A-p[mid][1])<0) l=mid+1; else r=mid; } return l;}int main(){ int i,j,k,a,b,pos; 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",&a,&b); p[i][0].x=a;p[i][0].y=y1; p[i][1].x=b;p[i][1].y=y2; } p[n][0].x=x2;p[n][0].y=y1; p[n][1].x=x2;p[n][1].y=y2; memset(num,0,sizeof(num)); while(m--) { scanf("%d%d",&A.x,&A.y); pos=find(); num[pos]++; } if(++t!=1) printf("\n"); for(i=0;i<=n;i++) printf("%d: %d\n",i,num[i]); }}
0 0
- TOYS - POJ 2318 叉积
- poj 2318 TOYS (叉积)
- Poj 2318 TOYS (叉积+二分)
- POJ 2318 TOYS 二分+叉积
- POJ 2318 TOYS (叉积)
- poj 2318 TOYS 二分+叉积
- poj 2318 TOYS(叉积)
- poj 2318 TOYS 二分+叉积
- poj-2318 TOYS (叉积)
- POJ 2318 TOYS (叉积)
- POJ 2318 TOYS(叉积+二分)
- poj 2318 TOYS(叉积+二分)
- POJ 2318 TOYS(叉积+二分查找)
- Poj 2318 toys (计算几何,叉积)
- POJ 2318 - TOYS【计算几何 - 叉积】
- poj 2318 TOYS(叉积+二分)
- POJ 2318 TOYS
- poj 2318 TOYS
- Mac新手操作指南(六)
- -无.限.互联.(北京).奖.学.金.连.载.第.一.篇. 刘彬 .第.49.期.学.员.-
- Java 判断中文字符
- poj 2942 Knights of the Round Table 【无向图求BCC + 黑白染色判断二分图】
- 每天一个linux命令(3):pwd命令
- TOYS - POJ 2318 叉积
- android studio学习配置androidannotations注解框架
- 预装正版win8.1无法获取win10推送问题解决
- 群体遗传中SNP评估pie值的计算
- hdu5115 Dire Wolf(2014北京现场赛)
- 一些学习资料分享
- (七十四)iOS8之前使socket可以后台运行的方法
- jdk的安装、卸载与简介
- iOS开发内存管理