CodeForces 19D Points(离散化+线段树+单点更新)
题目链接:
题意:给了三种操作
1:add(x,y)将这个点增加二维坐标系
2:remove(x,y)将这个点从二维坐标系移除。
3:find(x,y)就是找到在(x,y)右上方的第一个点。
思路:我们能够建立n个set以x为横坐标,那么我们这个题就转化为找一个最小的x是否存在满足条件,那么x一旦被找到。那么纵坐标就自然而然的找到了。当然更新操作就是对maxy的维护,然后查询操作就是找出一个最小的x。。
还有由于n很大,所以要採用离散化的方法。然后进行离线处理。还是就是掌握set的使用方法,看来得买本c++primer了。insert(int val)将val插入到set中。且保证有序,erase(int val)将val删除且保证有序。。
题目:
2 seconds
256 megabytes
standard input
standard output
Pete and Bob invented a new interesting game. Bob takes a sheet of paper and locates a Cartesian coordinate system on it as follows: point (0, 0) is located in the
bottom-left corner, Ox axis is directed right, Oy axis
is directed up. Pete gives Bob requests of three types:
- add x y — on the sheet of paper Bob marks a point with coordinates (x, y).
For each request of this type it's guaranteed that point(x, y) is not yet marked on Bob's sheet at the time of the request. - remove x y — on the sheet of paper Bob erases the previously marked point with coordinates (x, y).
For each request of this type it's guaranteed that point (x, y) is already marked on Bob's sheet at the time of the request. - find x y — on the sheet of paper Bob finds all the marked points, lying strictly above and strictly to the right of point (x, y).
Among these points Bob chooses the leftmost one, if it is not unique, he chooses the bottommost one, and gives its coordinates to Pete.
Bob managed to answer the requests, when they were 10, 100 or 1000, but when their amount grew up to 2·105,
Bob failed to cope. Now he needs a program that will answer all Pete's requests. Help Bob, please!
The first input line contains number n (1 ≤ n ≤ 2·105)
— amount of requests. Then there follow n lines — descriptions of the requests.add
x y describes the request to add a point, remove x y — the request to erase a point, find
x y — the request to find the bottom-left point. All the coordinates in the input file are non-negative and don't exceed 109.
For each request of type find x y output in a separate line the answer to it — coordinates of the bottommost among the leftmost marked points, lying strictly
above and to the right of point (x, y). If there are no points strictly above and to the right of point (x, y),
output -1.
7
add 1 1
add 3 4
find 0 0
remove 1 1
find 0 0
add 1 1
find 0 0
1 1
3 4
1 1
13
add 5 5
add 5 6
add 5 7
add 6 5
add 6 6
add 6 7
add 7 5
add 7 6
add 7 7
find 6 6
remove 7 7
find 6 6
find 4 4
7 7
-1
5 5
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
#include<set>
#include<cmath>
#include<string>
#include<queue>
#define eps 1e-9
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
const int maxn=200000+10;
struct Tree
{
int x,y;
char op[5];
void init()
{
scanf("%s%d%d",op,&x,&y);
}
}tree[maxn<<2]; set<int>xx[maxn];
int maxy[maxn<<2],top[maxn],n,m; void buildtree(int l,int r,int dex)
{
maxy[dex]=-1;
if(l==r) return;
int mid=(l+r)>>1;
buildtree(l,mid,dex<<1);
buildtree(mid+1,r,dex<<1|1);
} void update(int l,int r,int dex,int pos)
{
if(l==r)
{
if(xx[pos].size())
maxy[dex]=*(--xx[pos].end());
else
maxy[dex]=-1;
return;
}
int mid=(l+r)>>1;
if(pos<=mid) update(l,mid,dex<<1,pos);
else update(mid+1,r,dex<<1|1,pos);
maxy[dex]=max(maxy[dex<<1],maxy[dex<<1|1]);
} int Query(int l,int r,int dex,int L,int R,int val)
{
if(maxy[dex]<=val||L>R) return -1;//这里L>R是一个trick,wa在了第4组数据,有可能L>R
if(l==r) return l;
int mid=(l+r)>>1;
if(R<=mid) return Query(l,mid,dex<<1,L,R,val);
else if(L>mid) return Query(mid+1,r,dex<<1|1,L,R,val);
else
{
int t=Query(l,mid,dex<<1,L,R,val);
if(t!=-1) return t;
return Query(mid+1,r,dex<<1|1,L,R,val);
}
} int main()
{
while(~scanf("%d",&n))
{
for(int i=1;i<=n;i++)
{
tree[i].init();
top[i]=tree[i].x;
}//离散化
sort(top+1,top+1+n);
m=unique(top+1,top+1+n)-(top+1);
for(int i=1;i<=m;i++)
xx[i].clear();
buildtree(1,m,1);
for(int i=1;i<=n;i++)
{
int pos=lower_bound(top+1,top+1+m,tree[i].x)-top;
if(tree[i].op[0]=='a')
{
xx[pos].insert(tree[i].y);
update(1,m,1,pos);
}
else if(tree[i].op[0]=='r')
{
xx[pos].erase(tree[i].y);
update(1,m,1,pos);
}
else
{
int ans=Query(1,m,1,pos+1,m,tree[i].y);
if(ans==-1)
printf("-1\n");
else
printf("%d %d\n",top[ans],*xx[ans].upper_bound(tree[i].y));
}
}
}
return 0;
}
CodeForces 19D Points(离散化+线段树+单点更新)的更多相关文章
- CodeForces 19D Points(线段树+map)
开始想不通,后来看网上说是set,就有一个想法是对每个x建一个set...然后又想直接建立两重的set就好,最后发现不行,自己想多了... 题意是给你三种操作:add (x y) 平面添加(x y) ...
- POJ.2299 Ultra-QuickSort (线段树 单点更新 区间求和 逆序对 离散化)
POJ.2299 Ultra-QuickSort (线段树 单点更新 区间求和 逆序对 离散化) 题意分析 前置技能 线段树求逆序对 离散化 线段树求逆序对已经说过了,具体方法请看这里 离散化 有些数 ...
- HDU 1754 I Hate It 线段树单点更新求最大值
题目链接 线段树入门题,线段树单点更新求最大值问题. #include <iostream> #include <cstdio> #include <cmath> ...
- HDU 1166 敌兵布阵(线段树单点更新)
敌兵布阵 单点更新和区间更新还是有一些区别的,应该注意! [题目链接]敌兵布阵 [题目类型]线段树单点更新 &题意: 第一行一个整数T,表示有T组数据. 每组数据第一行一个正整数N(N< ...
- poj 2892---Tunnel Warfare(线段树单点更新、区间合并)
题目链接 Description During the War of Resistance Against Japan, tunnel warfare was carried out extensiv ...
- HDU 1166 敌兵布阵(线段树单点更新,板子题)
敌兵布阵 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submi ...
- POJ 1804 Brainman(5种解法,好题,【暴力】,【归并排序】,【线段树单点更新】,【树状数组】,【平衡树】)
Brainman Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 10575 Accepted: 5489 Descrip ...
- HDU 1166 敌兵布阵(线段树单点更新,区间查询)
描述 C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了.A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况 ...
- POJ.3321 Apple Tree ( DFS序 线段树 单点更新 区间求和)
POJ.3321 Apple Tree ( DFS序 线段树 单点更新 区间求和) 题意分析 卡卡屋前有一株苹果树,每年秋天,树上长了许多苹果.卡卡很喜欢苹果.树上有N个节点,卡卡给他们编号1到N,根 ...
随机推荐
- [Apple开发者帐户帮助]三、创建证书(1)证书概述
在开发应用程序的过程中,您将创建不同的证书类型,以便在不同的上下文中使用.您将为iOS,tvOS和watchOS应用程序使用相同的证书集,并为macOS应用程序使用不同的证书集.您将使用开发证书在设备 ...
- 记录一下Junit测试MongoDB,获取MongoTemplate
只是自己记录一下,测试MongoDB帮助类时,没有配置文件的测试 public class HelperTest { MongoTemplate template; @Before public vo ...
- Swagger UI改造 增加 Token验证、显示控制器注释、自定义泛型缓存应用、
/// <summary> /// Swagger 增加 Token 选项和控制器描述 /// </summary> public class CustomOperationF ...
- EF6 自定义迁移表名
在下列代码片段中已经EF6迁移表的表名更改为 MigrationHistory注意:下代码片段建议和DbContext同程序集 public class ModelConfiguration : Db ...
- UILabel垂直方向显示(上下的顺序显示)。
NSString* text = @"一"; NSDictionary *attribute = @{NSFontAttributeName: [UIFont systemFont ...
- 数组中hashCode就是内存地址,以及汉字幻化为16进制或10进制
int[] arr4={1,2,3,4,5}; System.out.println("arr4: "+arr4); System.out.println("arr4.h ...
- React+Dva
Reducer reducer 是一个函数,接受 state 和 action,返回老的或新的 state .即:(state, action) => state Effect app.mode ...
- java与安卓中的回调callback学习笔记
1.回调的简单设计如下: package com.listercai.top; public class A { private CallBack callBack; private AnotherC ...
- NetCore下获取项目文件路径
我要获取的是doc/FPFile.xml 百度了一大堆就是找不到解决问题. 把属性更改为始终赋值, XmlDocument xdi = new XmlDocument(); xdi.Load((&qu ...
- 安卓代码迁移:Make.exe: *** [***.o]Error 1
描述:NDK开发中显示,windows环境下NDK开发 解决办法:查找系统环境变量,找到关于Cygwin的环境变量或其他无效的环境变量删除处理.