POJ 2318 TOYS (叉积+二分)
Description
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
Output
Sample Input
- 5 6 0 10 60 0
- 3 1
- 4 3
- 6 8
- 10 10
- 15 30
- 1 5
- 2 1
- 2 8
- 5 5
- 40 10
- 7 9
- 4 10 0 10 100 0
- 20 20
- 40 40
- 60 60
- 80 80
- 5 10
- 15 10
- 25 10
- 35 10
- 45 10
- 55 10
- 65 10
- 75 10
- 85 10
- 95 10
- 0
Sample Output
- 0: 2
- 1: 1
- 2: 1
- 3: 1
- 4: 0
- 5: 1
- 0: 2
- 1: 2
- 2: 2
- 3: 2
- 4: 2
- 题意:给出一个矩形盒子 给出数条线段作为隔断 向盒子内放物品 判断每个区域内物品数量
思路:每输入一个物品位置 都二分查找隔断 利用叉积判断是在隔断的左侧还是右侧
- 代码如下:
- #include <iostream>
- #include <cstdio>
- #include <cstdlib>
- #include <cmath>
- #include <string>
- #include <cstring>
- #include <algorithm>
- using namespace std;
- typedef long long ll;
- typedef unsigned long long ull;
- const int inf=0x3f3f3f3f;
- const int maxn=;
- int ans[maxn];
- int n,m,x,y,xx,yy,tx,ty,U,L;
- struct Point{
- int x,y;
- Point(){}
- Point(int _x,int _y){
- x=_x,y=_y;
- }
- Point operator + (const Point &b) const {
- return Point(x+b.x,y+b.y);
- }
- Point operator - (const Point &b) const {
- return Point(x-b.x,y-b.y);
- }
- int operator * (const Point &b) const {
- return x*b.x+y*b.y;
- }
- int operator ^ (const Point &b) const {
- return x*b.y-y*b.x;
- }
- };
- struct Line{
- Point s,e;
- Line(){}
- Line(Point _s,Point _e){
- s=_s,e=_e;
- }
- }line[maxn];
- int xmult(Point p0,Point p1,Point p2){
- return (p1-p0)^(p2-p0);
- }
- int main(){
- while(scanf("%d",&n)== && n){
- scanf("%d%d%d%d%d",&m,&x,&y,&xx,&yy);
- for(int i=;i<n;i++){
- scanf("%d%d",&U,&L);
- ans[i]=;
- line[i]=Line(Point(U,y),Point(L,yy));
- }
- line[n]=Line(Point(xx,y),Point(xx,yy));
- Point p;
- memset(ans,,sizeof(ans));
- while(m--){
- scanf("%d%d",&tx,&ty);
- p=Point(tx,ty);
- int l=,r=n;
- int tmp;
- while(l<=r){
- int mid=(l+r)>>;
- if(xmult(p,line[mid].s,line[mid].e)<){
- tmp=mid;
- r=mid-;
- }
- else l=mid+;
- }
- ans[tmp]++;
- }
- for(int i=;i<=n;i++) printf("%d: %d\n",i,ans[i]);
- printf("\n");
- }
- return ;
- }
POJ 2318 TOYS (叉积+二分)的更多相关文章
- 2018.07.03 POJ 2318 TOYS(二分+简单计算几何)
TOYS Time Limit: 2000MS Memory Limit: 65536K Description Calculate the number of toys that land in e ...
- POJ 2318 TOYS 叉积
题目大意:给出一个长方形盒子的左上点,右下点坐标.给出n个隔板的坐标,和m个玩具的坐标,求每个区间内有多少个玩具. 题目思路:利用叉积判断玩具在隔板的左方或右方,并用二分优化查找过程. #includ ...
- POJ 2318 TOYS(叉积+二分)
题目传送门:POJ 2318 TOYS Description Calculate the number of toys that land in each bin of a partitioned ...
- poj 2318 TOYS (二分+叉积)
http://poj.org/problem?id=2318 TOYS Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 101 ...
- 向量的叉积 POJ 2318 TOYS & POJ 2398 Toy Storage
POJ 2318: 题目大意:给定一个盒子的左上角和右下角坐标,然后给n条线,可以将盒子分成n+1个部分,再给m个点,问每个区域内有多少各点 这个题用到关键的一步就是向量的叉积,假设一个点m在 由ab ...
- poj 2318 TOYS & poj 2398 Toy Storage (叉积)
链接:poj 2318 题意:有一个矩形盒子,盒子里有一些木块线段.而且这些线段坐标是依照顺序给出的. 有n条线段,把盒子分层了n+1个区域,然后有m个玩具.这m个玩具的坐标是已知的,问最后每一个区域 ...
- 简单几何(点与线段的位置) POJ 2318 TOYS && POJ 2398 Toy Storage
题目传送门 题意:POJ 2318 有一个长方形,用线段划分若干区域,给若干个点,问每个区域点的分布情况 分析:点和线段的位置判断可以用叉积判断.给的线段是排好序的,但是点是无序的,所以可以用二分优化 ...
- POJ 2318 TOYS && POJ 2398 Toy Storage(几何)
2318 TOYS 2398 Toy Storage 题意 : 给你n块板的坐标,m个玩具的具体坐标,2318中板是有序的,而2398无序需要自己排序,2318要求输出的是每个区间内的玩具数,而231 ...
- POJ 2318/2398 叉积性质
2318 2398 题意:给出n条线将一块区域分成n+1块空间,再给出m个点,询问这些点在哪个空间里. 思路:由于只要求相对位置关系,而对具体位置不关心,那么易使用叉积性质得到相对位置关系(左侧/右侧 ...
随机推荐
- Android测试(四):Instrumented 单元测试
原文:https://developer.android.com/training/testing/unit-testing/instrumented-unit-tests.html Instrume ...
- 使用github 的相关博客
基于hexo+github搭建一个独立博客 如何用Github的gh-pages分支展示自己的项目 使用git clone error: RPC failed Git的使用-- ...
- 解决java compiler level does not match the version of the installed java project facet【转载】
原博文地址http://blog.csdn.net/chszs/article/details/8125828 Java compiler level does not match the versi ...
- Data Governance
https://erwin.com/blog/data-preparation-mapping/
- NOIP2002普及组复赛B 选数
题目链接:https://ac.nowcoder.com/acm/contest/230/B 题目大意: 略 分析: DFS模板题. 代码如下: #include <bits/stdc++.h& ...
- Ajax跨域请求,无法传递及接收cookie信息
最近在做一个系统遇到一个问题,在网上找个一个和我遇到相同问题的(原文地址:https://www.cnblogs.com/helloyy/p/6109665.html)按照他的步骤还是没有解决,继续查 ...
- python json数据的转换
1 Python数据转json字符串 import json json_str = json.dumps(py_data) 参数解析: json_str = json.dumps(py_data,s ...
- Lodop某个电脑打印内容大小有问题
可能原因分析:本地设置放大比例问题,是真实的放大或缩小,1.查看比例应在100%, 2.控制面板设置显示应在100%(win7 win10中) 3.超文本样式问题,分析样式中不同浏览器版本下显示不一致 ...
- 三、Java多人博客系统-技术架构
多人博客系统1.0版本,架构和技术还是很简单和很传统的. 1.技术 前端:jsp.html.css.javascript.jquery.easyui.echarts 后端:spring mvc.Hib ...
- Spring Boot程序获取tomcat启动端口
package com.geostar.geostack.git_branch_manager.config; import org.springframework.beans.factory.ann ...