POJ2381——TOYS(暴力,叉积)
来源:互联网 发布:linux下获取cpu使用率 编辑:程序博客网 时间:2024/06/05 04:20
TOYS
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10850 Accepted: 5208
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
Hint
As the example illustrates, toys that fall on the boundary of the box are "in" the box.
Source
Rocky Mountain 2003
题意:给你一个矩形,有n条线段(线段两个端点分别位于矩形的上下边界)将这个矩形划分成n+1块的区域,然后有m个点分布在矩形中,问每个区域内的点的个数。
思路:利用向量的叉积,cross(v,w)>0 则 w位于v左侧 ; cross(v,w)<0 则 w位于v右侧
#include <algorithm>#include <cstdio>#include <cstdlib>#include <cmath>#include <cstring>#include <iostream>#define INF 0x7fffffffusing namespace std;typedef long long LL;const int N = 5000 + 10;const double esp = 1e-10;int dcmp(double x) {if(fabs(x) < esp) return 0; else return x<0?-1:1;}struct Point{ double x,y; Point(double x=0,double y=0):x(x),y(y){ }};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);}Vector operator * (Vector A, double p) {return Vector(A.x*p, A.y*p);}Vector operator / (Vector A, double p) {return Vector(A.x/p, A.y/p);}bool operator < (const Point& a, const Point& b){ return a.x<b.x || (a.x==b.x && a.y<b.y);}bool operator == (const Point& a, const Point& b){return dcmp(a.x-b.x)==0 && dcmp(a.y-b.y)==0;}double Dot(Vector A, Vector B){ return A.x*B.x+A.y*B.y; }double Length(Vector A){return sqrt(Dot(A, A));}double Angle(Vector A, Vector B) {return acos( Dot(A, B)/Length(A)/Length(B) );}double Cross(Vector A, Vector B) { return A.x*B.y - A.y*B.x ;}double Area2(Point A, Point B, Point C){return Cross(B-A, C-A); }Point B[N][2];int cnt[N];int n,m;int check(Point A){ for(int i=0;i<n;i++) { Vector W = A - B[i][1]; Vector V = B[i][0] - B[i][1]; if(Cross(V, W)>0) return i; } return n;}int main(){ int x1,x2,y1,y2; while(scanf("%d",&n)!=EOF&&n) { scanf("%d%d%d%d%d",&m,&x1,&y1,&x2,&y2); int U, L, x, y; memset(cnt,0,sizeof(cnt)); for(int i=0;i<n;i++) { scanf("%d%d",&U,&L); Point p1(U,y1), p2(L,y2); B[i][0] = p1; B[i][1] = p2; } for(int i=0;i<m;i++) { Point A; scanf("%lf%lf",&A.x, &A.y); cnt[check(A)]++; } for(int i=0;i<=n;i++) { printf("%d: %d\n",i,cnt[i]); } printf("\n"); } return 0;}
0 0
- POJ2381——TOYS(暴力,叉积)
- poj2381
- poj2381
- poj2318——TOYS
- POJ 2318 TOYS(叉积+二分or暴力)
- POJ 2318 —— TOYS(叉积+二分)
- POJ-2318 TOYS,暴力+叉积判断!
- poj2318—TOYS(计算几何+二分)
- TOYS - POJ 2318 叉积
- poj 2318 TOYS (叉积)
- TOYS
- TOYS
- TOYS
- hdu 5419 Victor and Toys(暴力+组合)
- ACM-计算几何之Toys——poj2318
- poj(2318)——TOYS(叉积的简单应用)
- pku 2318 TOYS(叉积,二分)
- Poj 2318 TOYS (叉积+二分)
- 近期需要进行看的书
- JAVA正则表达式
- 队列之银行排号模拟
- Oracle 12c RAC 替换 OCR 磁盘组操作步骤
- 以太网数据包、IP包、TCP/UDP 包结构
- POJ2381——TOYS(暴力,叉积)
- MySQL设置当前时间为默认值的方法
- js设置新的日期时间
- Android之TelephonyManager类的方法详解
- 【学习ios之路:C语言】结构体应用
- 程序员进阶
- VirtualBox下使用桥接实现宿主机互联
- 目前各大网站盈利模式
- RRT,看看国外业界良心在做啥