【计算几何】 poj2398 Toy Storage
来源:互联网 发布:玩游戏网络卡怎么办 编辑:程序博客网 时间:2024/05/01 22:07
Toy Storage
http://poj.org/problem?id=2398
Description
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
本题和poj2318 TOYS大致一样,但有一些不同。
1:输入是无序的,需要自己排序。
2:输出是输出拥有相同玩具数的区块有几个。 (区块里的玩具数:相同玩具数的区块个数)
知道题意就很好做了。
#include<cstdio>#include<cstring>#include<map>#include<algorithm>using namespace std;#define MAX 5005#define LL long longstruct line{ LL a,b;}seg[MAX],a,b,node;LL counts[MAX];map<LL,int> mat;int n,m;bool cmp(const line &a,const line &b){ return a.a<b.a;}int cross(int m){ return (seg[m].a-seg[m].b)*(node.b-b.b)-(a.b-b.b)*(node.a-seg[m].b);}void binarySearch(){ //printf("node %I64d %I64d ",node.a,node.b); int l=0,r=n,mid; for(;l<=r;) { mid=(l+r)>>1; if(cross(mid)<0) l=mid+1; else r=mid-1; } //printf("in %d\n",l); counts[l]++;}int main(){ for(;scanf("%d",&n),n;) { memset(counts,0,sizeof(counts)); mat.clear(); scanf("%d",&m); scanf("%I64d%I64d%I64d%I64d",&a.a,&a.b,&b.a,&b.b); seg[0].a=seg[0].b=a.a; for(int i=1;i<=n;++i) scanf("%I64d%I64d",&seg[i].a,&seg[i].b); sort(seg,seg+n+1,cmp); for(;m--;) { scanf("%I64d%I64d",&node.a,&node.b); binarySearch(); } //for(int i=1;i<=n+1;++i) // printf("i=%d counts=%I64d\n",i,counts[i]); for(int i=1;i<=n+1;++i) { if(counts[i]!=0) { if(mat.find(counts[i])!=mat.end()) mat.find(counts[i])->second++; else mat.insert(make_pair(counts[i],1)); } } puts("Box"); for(map<LL,int>::iterator it=mat.begin();it!=mat.end();++it) printf("%I64d: %d\n",it->first,it->second); } return 0;}
- 【计算几何】 poj2398 Toy Storage
- [POJ2398]Toy Storage(计算几何+二分)
- ACM-计算几何之Toy Storage——poj2398
- ACM-计算几何之Toy Storage——poj2398
- poj2398——Toy Storage(计算几何)
- poj2398 - Toy Storage
- [Poj2398]Toy Storage
- POJ2398-Toy Storage
- poj2398 Toy Storage
- POJ2398——Toy Storage
- POJ2318 TOYS, POJ2398 Toy Storage
- poj2398 Toy Storage【叉乘】
- POJ--2398 -- Toy Storage [计算几何]
- poj 2398 Toy Storage(计算几何)
- Toy Storage(二维计算几何基础)
- POJ 2398 Toy Storage(计算几何)
- POJ 2398 Toy Storage(计算几何)
- 【POJ 2398】Toy Storage(计算几何)
- 再谈读书与信息的获取、沉淀
- jrtplib 源码分析 (三) SOCKET
- android中实现消息推送
- Android4.0 TP多点变单点,单点变多点问题
- GCD之dispatch queue
- 【计算几何】 poj2398 Toy Storage
- iframe 父窗口和子窗口相互的调用方法
- 在Eclipse下搭建Android开发环境教程(3)
- Linux umask解析
- 教你如何构建开源WebGIS系统
- 让jar文件在windows下双击可运行
- Grand Central Dispatch
- 在Eclipse下搭建Android开发环境教程(4)
- eclipse安装插件的四种方法