POJ 题目3667 Hotel(线段树,区间更新查询,求连续区间)
来源:互联网 发布:tcl编程语言有用吗 编辑:程序博客网 时间:2024/04/29 05:27
Description
The cows are journeying north to Thunder Bay in Canada to gain cultural enrichment and enjoy a vacation on the sunny shores of Lake Superior. Bessie, ever the competent travel agent, has named the Bullmoose Hotel on famed Cumberland Street as their vacation residence. This immense hotel has N (1 ≤ N ≤ 50,000) rooms all located on the same side of an extremely long hallway (all the better to see the lake, of course).
The cows and other visitors arrive in groups of size Di (1 ≤Di ≤ N) and approach the front desk to check in. Each group i requests a set of Di contiguous rooms from Canmuu, the moose staffing the counter. He assigns them some set of consecutive room numbersr..r+Di-1 if they are available or, if no contiguous set of rooms is available, politely suggests alternate lodging. Canmuu always chooses the value ofr to be the smallest possible.
Visitors also depart the hotel from groups of contiguous rooms. Checkout i has the parameters Xi andDi which specify the vacating of rooms Xi ..Xi +Di-1 (1 ≤Xi ≤ N-Di+1). Some (or all) of those rooms might be empty before the checkout.
Your job is to assist Canmuu by processing M (1 ≤ M < 50,000) checkin/checkout requests. The hotel is initially unoccupied.
Input
* Line 1: Two space-separated integers: N and M
* Lines 2..M+1: Line i+1 contains request expressed as one of two possible formats: (a) Two space separated integers representing a check-in request: 1 andDi (b) Three space-separated integers representing a check-out: 2,Xi, and Di
Output
* Lines 1.....: For each check-in request, output a single line with a single integerr, the first room in the contiguous sequence of rooms to be occupied. If the request cannot be satisfied, output 0.
Sample Input
10 61 31 31 31 32 5 51 6
Sample Output
14705
Source
USACO 2008 February Gold
题意:有一个线段,从1到n,下面m个操作,操作分两个类型,以1开头的是查询操作,以2开头的是更新操作
1 w 表示在总区间内查询一个长度为w的可用区间,并且要最靠左,能找到的话返回这个区间的左端点并占用了这个区间,找不到返回0
好像n=10 , 1 3 查到的最左的长度为3的可用区间就是[1,3],返回1,并且该区间被占用了
2 a len , 表示从单位a开始,清除一段长度为len的区间(将其变为可用,不被占用),不需要输出
ac代码#include<stdio.h>#include<string.h>#define max(a,b) (a>b?a:b)struct s{int ll,rl,ml,cover;}node[50050<<2];void build(int l,int r,int tr){node[tr].ll=node[tr].rl=node[tr].ml=r-l+1;node[tr].cover=-1;if(l==r)return;int mid=(l+r)>>1;build(l,mid,tr<<1);build(mid+1,r,tr<<1|1);}void pushdown(int tr,int m){if(node[tr].cover!=-1){node[tr<<1].cover=node[tr<<1|1].cover=node[tr].cover;if(node[tr].cover==0){node[tr<<1].ll=node[tr<<1].rl=node[tr<<1].ml=m-(m>>1);node[tr<<1|1].ll=node[tr<<1|1].rl=node[tr<<1|1].ml=(m>>1);}else{node[tr<<1].ll=node[tr<<1].rl=node[tr<<1].ml=0;node[tr<<1|1].ll=node[tr<<1|1].rl=node[tr<<1|1].ml=0;}node[tr].cover=-1;}}void pushup(int tr,int m){node[tr].ll=node[tr<<1].ll;node[tr].rl=node[tr<<1|1].rl;if(node[tr].ll==m-(m>>1))node[tr].ll+=node[tr<<1|1].ll;if(node[tr].rl==(m>>1))node[tr].rl+=node[tr<<1].rl;node[tr].ml=max(node[tr<<1].rl+node[tr<<1|1].ll,max(node[tr<<1].ml,node[tr<<1|1].ml));}void update(int L,int R,int l,int r,int tr,int val){if(L<=l&&R>=r){if(val){node[tr].ll=node[tr].rl=node[tr].ml=0;}elsenode[tr].ll=node[tr].rl=node[tr].ml=r-l+1;node[tr].cover=val;return;}pushdown(tr,r-l+1);int mid=(l+r)>>1;if(L>mid){update(L,R,mid+1,r,tr<<1|1,val);}elseif(R<=mid){update(L,R,l,mid,tr<<1,val);}else{update(L,mid,l,mid,tr<<1,val);update(mid+1,R,mid+1,r,tr<<1|1,val);}/*if(L<=mid)update(L,R,l,mid,tr<<1,val);if(R>mid)update(L,R,mid+1,r,tr<<1|1,val);*/pushup(tr,r-l+1);}int query(int w,int l,int r,int tr){if(l==r)return l;pushdown(tr,r-l+1);int mid=(l+r)>>1;if(node[tr<<1].ml>=w)return query(w,l,mid,tr<<1);elseif(node[tr<<1].rl+node[tr<<1|1].ll>=w)return mid-node[tr<<1].rl+1;elsereturn query(w,mid+1,r,tr<<1|1);}int main(){int n,m;while(scanf("%d%d",&n,&m)!=EOF){build(1,n,1);while(m--){int op;scanf("%d",&op);if(op==1){int a;scanf("%d",&a);if(a>node[1].ml){printf("0\n");continue;}int p=query(a,1,n,1);printf("%d\n",p);update(p,p+a-1,1,n,1,1);}else{int a,b;scanf("%d%D",&a,&b);update(a,a+b-1,1,n,1,0);}}}}
- POJ 题目3667 Hotel(线段树,区间更新查询,求连续区间)
- poj 3667 Hotel(线段树求区间连续值)
- poj 3667 Hotel(线段树区间更新)
- POJ 题目2892 Tunnel Warfare(线段树单点更新查询,求单点所在最大连续区间长度)
- POJ 3667 Hotel 线段树 区间更新 区间合并
- POJ 3667 Hotel (线段树区间最大连续长度)
- POJ 3667 Hotel 线段树 区间合并(成段更新)
- poj 3667 Hotel(线段树区间更新合并)
- POJ 3667 Hotel (线段树 区间更新查找)
- POJ 3667 Hotel [线段树+区间更新]【数据结构】
- poj 1823 Hotel(数据结构:线段树--区间更新)
- POJ 1823 Hotel(线段树区间更新)
- POJ 3667 Hotel(线段树区间合并查询)
- POJ 3667 Hotel(线段树:区间覆盖,维护最大连续子区间)
- POJ 3667 Hotel 线段树区间合并
- poj 3667 Hotel 线段树区间合并
- POJ 3667 Hotel 线段树 区间合并
- Poj 3667 Hotel 线段树 区间合并
- Android中Services简析
- Oracl Level用法
- Palindrome Partitioning
- hdu 4707 Pet(DFS && 邻接表)
- 网络访问基础篇(适合新手)
- POJ 题目3667 Hotel(线段树,区间更新查询,求连续区间)
- 2015,我与前端有份约定——暑期集训尾声有感
- 金融大数据:战略规划与实践指南——互动出版网
- UTF-8编码导致JS输出中文乱码
- mysqldump参数之-d -t -T
- nyoj30Gone Fishing
- UVA 1151 Buy or Build
- Caffe学习:Solver
- WinCE 背光调节