Mayor's posters(线段树区间更新+离散化)
来源:互联网 发布:通达信 kdj源码 编辑:程序博客网 时间:2024/05/28 16:16
Link:http://poj.org/problem?id=2528
Mayor's posters
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 46164 Accepted: 13379
Description
The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city council has finally decided to build an electoral wall for placing the posters and introduce the following rules:
They have built a wall 10000000 bytes long (such that there is enough place for all candidates). When the electoral campaign was restarted, the candidates were placing their posters on the wall and their posters differed widely in width. Moreover, the candidates started placing their posters on wall segments already occupied by other posters. Everyone in Bytetown was curious whose posters will be visible (entirely or in part) on the last day before elections.
Your task is to find the number of visible posters when all the posters are placed given the information about posters' size, their place and order of placement on the electoral wall.
- Every candidate can place exactly one poster on the wall.
- All posters are of the same height equal to the height of the wall; the width of a poster can be any integer number of bytes (byte is the unit of length in Bytetown).
- The wall is divided into segments and the width of each segment is one byte.
- Each poster must completely cover a contiguous number of wall segments.
They have built a wall 10000000 bytes long (such that there is enough place for all candidates). When the electoral campaign was restarted, the candidates were placing their posters on the wall and their posters differed widely in width. Moreover, the candidates started placing their posters on wall segments already occupied by other posters. Everyone in Bytetown was curious whose posters will be visible (entirely or in part) on the last day before elections.
Your task is to find the number of visible posters when all the posters are placed given the information about posters' size, their place and order of placement on the electoral wall.
Input
The first line of input contains a number c giving the number of cases that follow. The first line of data for a single case contains number 1 <= n <= 10000. The subsequent n lines describe the posters in the order in which they were placed. The i-th line among the n lines contains two integer numbers li and ri which are the number of the wall segment occupied by the left end and the right end of the i-th poster, respectively. We know that for each 1 <= i <= n, 1 <= li <= ri <= 10000000. After the i-th poster is placed, it entirely covers all wall segments numbered li, li+1 ,... , ri.
Output
For each input data set print the number of visible posters after all the posters are placed.
The picture below illustrates the case of the sample input.
The picture below illustrates the case of the sample input.
Sample Input
151 42 68 103 47 10
Sample Output
4
Source
Alberta Collegiate Programming Contest 2003.10.18
用到的线段树功能有:update:成段替换query:简单hash
AC code:
/*不离散化势必MLE,此题离散化即是区间压缩,就是把一些无用的区间进行压缩,而不改变区间的覆盖关系,从而达到节省空间的目的。 */ #include<iostream>#include<algorithm>#include<cstring>#include<cmath>#include<cstdio>#include<queue>#define LL long long#define MAXN 40005using namespace std;int linecover[MAXN];LL ans;struct node{int l,r,c;}tree[MAXN*3];struct linenode{int id;int s;int f;}p[MAXN*3];struct lisan{int id;int st;int ed;}pp[MAXN*3];bool cmp(linenode x,linenode y){return x.s<y.s;}void build(int rt,int s,int e){tree[rt].l=s;tree[rt].r=e;tree[rt].c=0;if(s==e){return;}int mid=(s+e)/2;build(rt*2,s,mid);build(rt*2+1,mid+1,e);}void update(int rt,int l,int r,int cnt){if(tree[rt].l==l&&tree[rt].r==r){tree[rt].c=cnt;return;}int mid=(tree[rt].l+tree[rt].r)/2;if(tree[rt].c!=0)//pushdown操作 {tree[rt*2].c=tree[rt*2+1].c=tree[rt].c;tree[rt].c=0;}if(r<=mid){update(rt*2,l,r,cnt);}else if(l>mid){update(rt*2+1,l,r,cnt);}else{update(rt*2,l,mid,cnt);update(rt*2+1,mid+1,r,cnt);}}void query(int rt,int l,int r){if(tree[rt].c!=0){if(!linecover[tree[rt].c]){ans++;linecover[tree[rt].c]=1;}return;}int mid=(l+r)/2;query(rt*2,l,mid);query(rt*2+1,mid+1,r);}int main(){int t,n,i,st,ed;scanf("%d",&t);while(t--){scanf("%d",&n);for(i=1;i<=n;i++){scanf("%d%d",&st,&ed);p[i*2-1].s=st;p[i*2-1].f=0;p[i*2-1].id=i;p[i*2].s=ed;p[i*2].id=i;p[i*2].f=1;}sort(p+1,p+2*n+1,cmp);int tmp=p[1].s;int cnt=1;/*不知为何,我把下面两行注释掉的代码写在外面poj就会RE,全部写在循环里面才AC*/ //pp[p[1].id].id=p[1].id; //pp[p[1].id].st=cnt;//排序后第一个点肯定是某一条线段的起点 for(i=1;i<=2*n;i++)//离散化 {if(tmp!=p[i].s){cnt++;tmp=p[i].s;}pp[p[i].id].id=p[i].id;if(p[i].f==0){pp[p[i].id].st=cnt;}else if(p[i].f==1){pp[p[i].id].ed=cnt;}}memset(linecover,0,sizeof(linecover));build(1,1,cnt);for(i=1;i<=n;i++){update(1,pp[i].st,pp[i].ed,pp[i].id);}ans=0;query(1,1,cnt);cout<<ans<<endl;}return 0;}
0 0
- Mayor's posters(线段树区间更新+离散化)
- Mayor's posters (线段树+离散化+区间更新)
- POJ2528:Mayor's posters(线段树区间更新+离散化)
- POJ2528 Mayor's posters 线段树区间更新+离散化
- POJ2528 Mayor's posters(线段树区间更新,离散化)
- poj2528-Mayor's posters(线段树,区间,离散化)
- POJ 2528-Mayor's posters(线段树区间更新+离散化)
- POJ 2528 Mayor's posters (离散化+线段树区间更新)
- poj 2528 Mayor's posters(线段树 离散化 区间更新 贴海报)
- Poj 2528 Mayor's posters (线段树区间更新+离散化)
- poj 2528 Mayor's posters(线段树 二分 大数据离散化 区间更新)
- POJ 2528 Mayor's posters (线段树区间更新、离散化)
- POJ 2528 Mayor's posters (线段树 区间更新+离散化)
- POJ 2558 Mayor's posters(线段树+离散化+区间更新)
- 线段树区间更新,区间统计+离散化 POJ 2528 Mayor's posters
- POJ.2528 Mayor's posters (线段树 区间更新 区间查询 离散化)
- POJ 2528 Mayor's posters 区间离散化线段树
- poj 2528 Mayor's posters(线段树+区间离散化)
- xcode6 如何编译64位iOS应用
- 表达式求值
- Intersection of Two Linked Lists
- CodeForces 388A Fox and Box Accumulation(贪心)
- SerialPortManager总结
- Mayor's posters(线段树区间更新+离散化)
- Perl 域名转换为IP
- Eclipse MyEclipse 使用 复制粘贴 卡、缓慢的解决办法
- 图片处理--处理成灰色图片,高斯模糊
- 微信摇一摇.周边 (技术实施原理)
- matlab画三角形,多边形
- GDB 调试积累心得,断点,查栈,下一步,跳入,跳出等简单操作
- 活了二十多年,今天才知道柚子是怎样挑的
- 获取泛型类型T的实际类的Class对象