POJ 2398 Toy Storage
来源:互联网 发布:mac lol 韩服 编辑:程序博客网 时间:2024/06/08 05:08
Toy Storage
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6120 Accepted: 3655
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
Source
Tehran 2003 Preliminary
就是输出方式变了,统计出来,在每个隔间内有多少个玩具,没有的不输出
My ugly code
#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <algorithm>using namespace std;struct Point{ int x,y;};struct Line{ Point a,b;}line[1010];int n,m,xa,ya,xb,yb;bool cmp(Line La,Line Lb){ if(min(La.a.x,La.b.x) == min(Lb.a.x,Lb.b.x)){ return max(La.a.x,La.b.x) < max(Lb.a.x,Lb.b.x); } return min(La.a.x,La.b.x) < min(Lb.a.x,Lb.b.x);}int Multi(Point p1,Point p2,Point p0){ return (p1.x - p0.x) * (p2.y - p0.y) - (p2.x - p0.x)*(p1.y-p0.y);}int main(){ while(~scanf("%d",&n)&&n){ scanf("%d%d%d%d%d",&m,&xa,&ya,&xb,&yb); for(int i=1;i<=n;i++){ int u,l; scanf("%d%d",&u,&l); line[i].a.x=u; line[i].a.y=ya; line[i].b.x=l; line[i].b.y=yb; } sort(line+1,line+1+n,cmp); /*for(int i=1;i<=n;i++){ printf("**<%d,%d>***<%d,%d>\n",line[i].a.x,line[i].a.y,line[i].b.x,line[i].b.y); }*/ Point ppp; int ans[1010]; memset(ans,0,sizeof(ans)); int flag; for(int i=1;i<=m;i++){ scanf("%d%d",&ppp.x,&ppp.y); flag=0; for(int i=1;i<=n;i++){ int tmp=Multi(ppp,line[i].b,line[i].a); if(tmp > 0) { ans[i]++; flag=1; break ; } } if(!flag){ ans[n+1]++; } } int sal[1010]; memset(sal,0,sizeof(sal)); for(int i=1;i<=n+1;i++){ sal[ans[i]]++; } printf("Box\n"); for(int i=1;i<=m;i++){ if(sal[i] > 0){ printf("%d: %d\n",i,sal[i]); } } } return 0;}
阅读全文
0 0
- poj 2398 Toy Storage
- poj 2398 Toy Storage
- POJ 2398 Toy Storage
- POJ 2398 Toy Storage
- poj 2398 toy storage
- poj 2398 Toy Storage
- POJ 2398 Toy Storage
- poj 2398Toy Storage
- POJ 2398 Toy Storage
- poj 2398 Toy Storage
- poj 2398 Toy Storage
- poj 2398 Toy Storage
- Poj-2398-Toy Storage
- poj 2398 Toy Storage
- poj 2398 Toy Storage
- poj 2398 Toy Storage
- Toy Storage(poj 2398)
- POJ 2398 Toy Storage
- Solr之拼音检索。
- 更新mininet内置的ovs
- CS231N lecture7 notes
- spark性能调优都有哪些方法
- 15.8 验证码和新鲜度
- POJ 2398 Toy Storage
- this指针(C++)
- 服务器快速集成Nginx
- 极光推送服务器端实例
- 安卓自定义View进阶-Matrix原理
- 欢迎使用CSDN-markdown编辑器
- maven 的 clean complie 以及install的插件报错
- pycharm下使用github
- qq群获取不到qq文件