Toy Storage(二维计算几何基础)
来源:互联网 发布:网络支付平台的弊端 编辑:程序博客网 时间:2024/05/01 21:48
题目来源:[NWPU][2014][TRN][19]二维计算几何基础 B 题
http://vjudge.net/vjudge/contest/view.action?cid=54080#problem/B
作者:npufz
题目:
B - Toy Storage
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescription
Mom and dad have a problem: their child, Reza, never puts his toys away when he is finished playing with them. They gave Reza a rectangular box to put his toys in. Unfortunately, Reza 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 Reza to find his favorite toys anymore.
Reza's parents came up with the following idea. They put cardboard partitions into the box. Even if Reza keeps throwing his toys into the box, at least toys that get thrown into different partitions stay separate. The box looks like this from the top:
We want for each positive integer t, such that there exists a partition with t toys, determine how many partitions have t, toys.
Reza's parents came up with the following idea. They put cardboard partitions into the box. Even if Reza keeps throwing his toys into the box, at least toys that get thrown into different partitions stay separate. The box looks like this from the top:
We want for each positive integer t, such that there exists a partition with t toys, determine how many partitions have t, toys.
Input
The input consists of a number of cases. The first line consists of six integers n, m, x1, y1, x2, y2. The number of cardboards to form the partitions is n (0 < n <= 1000) and the number of toys is given in m (0 < m <= 1000). 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 each consists of two integers Ui Li, indicating that the ends of the ith cardboard is at the coordinates (Ui, y1) and (Li, y2). You may assume that the cardboards do not intersect with each other. The next m lines each consists of two integers Xi Yi specifying where the ith toy has landed in the box. You may assume that no toy will land on a cardboard.
A line consisting of a single 0 terminates the input.
A line consisting of a single 0 terminates the input.
Output
For each box, first provide a header stating "Box" on a line of its own. After that, there will be one line of output per count (t > 0) of toys in a partition. The value t will be followed by a colon and a space, followed the number of partitions containing t toys. Output will be sorted in ascending order of t for each box.
Sample Input
4 10 0 10 100 020 2080 8060 6040 405 1015 1095 1025 1065 1075 1035 1045 1055 1085 105 6 0 10 60 04 315 303 16 810 102 12 81 55 540 107 90
Sample Output
Box2: 5Box1: 42: 1
代码:
#include <iostream>#include <cstdio>#include <cmath>#include <cstring>#include <algorithm>using namespace std;typedef struct board{ double x1; double x2;} bo;inline bool cross(const double &x1,const double &x2,const double &x3,const double &x4,const double y1,const double y2,const double x0,const double y0){ double m1,m2; bool flag; m1=x1+(x2-x1)*(y0-y1)/(y2-y1); m2=x3+(x4-x3)*(y0-y1)/(y2-y1); if((m1<=x0)&&(m2>=x0)) flag=true; else flag=false; return flag;}bool cmp(board x,board y){ return x.x1<y.x1;}int main(){ bo b[2050]; int i,j,m,n; double x[2],y[2],x0,y0; int cnt[2050]; while(scanf("%d",&n),n) { scanf("%d%lf%lf%lf%lf",&m,&x[0],&y[0],&x[1],&y[1]); b[0].x1=x[0]; b[0].x2=x[0]; b[n+1].x1=x[1]; b[n+1].x2=x[1]; for(i=1;i<=n;i++) scanf("%lf%lf",&b[i].x1,&b[i].x2); memset(cnt,0,sizeof(cnt)); sort(b,b+n+1,cmp); for(i=0;i<m;i++) { scanf("%lf%lf",&x0,&y0); for(j=0;j<=n;j++) { if(cross(b[j].x1,b[j].x2,b[j+1].x1,b[j+1].x2,y[0],y[1],x0,y0)) { cnt[j]++; break; } } } int cnt1[2050]; memset (cnt1,0,sizeof(cnt1)); for(i=0;i<=n;i++) { cnt1[cnt[i]]++; } printf("Box\n"); for(i=1;i<=m;i++) { if(cnt1[i]>0) printf("%d: %d\n",i,cnt1[i]); } }return 0;}
反思:
其实思路很简单,就是代码 的实现,每次判断一下玩具在不在两个板之间就可以了,这里由于任意两个板不交叉,所以可以先对板按照一个端点的X坐标进行排序,这样就OK了,然后处理起来就很方便了,由于数据量很小,N*N的复杂度就能过
0 0
- Toy Storage(二维计算几何基础)
- poj 2398 Toy Storage(计算几何)
- 【POJ 2398】Toy Storage(计算几何)
- poj 2398 Toy Storage (计算几何)
- [POJ2398]Toy Storage(计算几何+二分)
- 【计算几何】 poj2398 Toy Storage
- poj 题目2398 Toy Storage (简单计算几何)
- poj 2398 Toy Storage(计算几何:叉积)
- poj2398——Toy Storage(计算几何)
- POJ--2398 -- Toy Storage [计算几何]
- POJ 2398 Toy Storage(计算几何)
- POJ 2398 Toy Storage(计算几何)
- poj 2398 Toy Storage (计算几何)
- poj 2398 Toy Storage 计算几何+二分
- 计算几何 - 二维几何基础 (模板)
- 【hdu】 Toy Storage 几何
- 二维计算几何基础
- 二维计算几何基础
- iOS多线程的初步研究(二)-- 锁
- oracle sql 按时间统计(天、周、月、季、年)
- python 不超过20行的小练习
- class 的static成员变量和 static 成员函数
- 近来写一个三维家居软件的历程
- Toy Storage(二维计算几何基础)
- 打开或者创建数据库的操作应该放在哪里?
- Override和final
- openstack Networking in too much detail
- Python数据结构:序列(列表[]、元组())与映射(字典{})语法总结
- C++ 用libcurl库进行http 网络通讯编程
- J2EE编程心得-使用Hibernate出现的错误及解决方法 更新中...
- Cocos2d-x JSB + Cocos2d-html5 跨平台游戏开发(一)—— 引擎选择
- PHP中比较两个时间的大小与日期的差值