A Corrupt Mayor's Performance Art+线段树区间更新查询
来源:互联网 发布:linux 服务器硬件信息 编辑:程序博客网 时间:2024/05/18 00:19
A Corrupt Mayor's Performance Art
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 100000/100000 K (Java/Others)Total Submission(s): 185 Accepted Submission(s): 94
Problem Description
Corrupt governors always find ways to get dirty money. Paint something, then sell the worthless painting at a high price to someone who wants to bribe him/her on an auction, this seemed a safe way for mayor X to make money.
Because a lot of people praised mayor X's painting(of course, X was a mayor), mayor X believed more and more that he was a very talented painter. Soon mayor X was not satisfied with only making money. He wanted to be a famous painter. So he joined the local painting associates. Other painters had to elect him as the chairman of the associates. Then his painting sold at better price.
The local middle school from which mayor X graduated, wanted to beat mayor X's horse fart(In Chinese English, beating one's horse fart means flattering one hard). They built a wall, and invited mayor X to paint on it. Mayor X was very happy. But he really had no idea about what to paint because he could only paint very abstract paintings which nobody really understand. Mayor X's secretary suggested that he could make this thing not only a painting, but also a performance art work.
This was the secretary's idea:
The wall was divided into N segments and the width of each segment was one cun(cun is a Chinese length unit). All segments were numbered from 1 to N, from left to right. There were 30 kinds of colors mayor X could use to paint the wall. They named those colors as color 1, color 2 .... color 30. The wall's original color was color 2. Every time mayor X would paint some consecutive segments with a certain kind of color, and he did this for many times. Trying to make his performance art fancy, mayor X declared that at any moment, if someone asked how many kind of colors were there on any consecutive segments, he could give the number immediately without counting.
But mayor X didn't know how to give the right answer. Your friend, Mr. W was an secret officer of anti-corruption bureau, he helped mayor X on this problem and gained his trust. Do you know how Mr. Q did this?
Because a lot of people praised mayor X's painting(of course, X was a mayor), mayor X believed more and more that he was a very talented painter. Soon mayor X was not satisfied with only making money. He wanted to be a famous painter. So he joined the local painting associates. Other painters had to elect him as the chairman of the associates. Then his painting sold at better price.
The local middle school from which mayor X graduated, wanted to beat mayor X's horse fart(In Chinese English, beating one's horse fart means flattering one hard). They built a wall, and invited mayor X to paint on it. Mayor X was very happy. But he really had no idea about what to paint because he could only paint very abstract paintings which nobody really understand. Mayor X's secretary suggested that he could make this thing not only a painting, but also a performance art work.
This was the secretary's idea:
The wall was divided into N segments and the width of each segment was one cun(cun is a Chinese length unit). All segments were numbered from 1 to N, from left to right. There were 30 kinds of colors mayor X could use to paint the wall. They named those colors as color 1, color 2 .... color 30. The wall's original color was color 2. Every time mayor X would paint some consecutive segments with a certain kind of color, and he did this for many times. Trying to make his performance art fancy, mayor X declared that at any moment, if someone asked how many kind of colors were there on any consecutive segments, he could give the number immediately without counting.
But mayor X didn't know how to give the right answer. Your friend, Mr. W was an secret officer of anti-corruption bureau, he helped mayor X on this problem and gained his trust. Do you know how Mr. Q did this?
Input
There are several test cases.
For each test case:
The first line contains two integers, N and M ,meaning that the wall is divided into N segments and there are M operations(0 < N <= 1,000,000; 0<M<=100,000)
Then M lines follow, each representing an operation. There are two kinds of operations, as described below:
1) P a b c
a, b and c are integers. This operation means that mayor X painted all segments from segment a to segment b with color c ( 0 < a<=b <= N, 0 < c <= 30).
2) Q a b
a and b are integers. This is a query operation. It means that someone asked that how many kinds of colors were there from segment a to segment b ( 0 < a<=b <= N).
Please note that the operations are given in time sequence.
The input ends with M = 0 and N = 0.
For each test case:
The first line contains two integers, N and M ,meaning that the wall is divided into N segments and there are M operations(0 < N <= 1,000,000; 0<M<=100,000)
Then M lines follow, each representing an operation. There are two kinds of operations, as described below:
1) P a b c
a, b and c are integers. This operation means that mayor X painted all segments from segment a to segment b with color c ( 0 < a<=b <= N, 0 < c <= 30).
2) Q a b
a and b are integers. This is a query operation. It means that someone asked that how many kinds of colors were there from segment a to segment b ( 0 < a<=b <= N).
Please note that the operations are given in time sequence.
The input ends with M = 0 and N = 0.
Output
For each query operation, print all kinds of color on the queried segments. For color 1, print 1, for color 2, print 2 ... etc. And this color sequence must be in ascending order.
Sample Input
5 10P 1 2 3P 2 3 4Q 2 3Q 1 3P 3 5 4P 1 2 7Q 1 3Q 3 4P 5 5 8Q 1 50 0
Sample Output
43 44 744 7 8解决方案:这题和POJ Count Color 是一样的,不过这里要输出的颜色。
code:
#include<iostream>#include<cstdio>#include<cstring>#define MMAX 1000005#define lson rt<<1,L,M#define rson rt<<1|1,M+1,Rusing namespace std;unsigned int color[MMAX<<2];///记录区间的颜色bool lazy[MMAX<<2];///lazy标志bool vis[33];int N,T,Q;void get(unsigned t){ for(int i=0; i<30; i++) { if((t>>i)&0x00000001) { vis[i]=true; } }}void build(int rt,int L,int R){ if(L==R) { color[rt]=(0x00000002); lazy[rt]=false; } else { int M=(L+R)>>1; build(lson); build(rson); color[rt]=0x00000002; lazy[rt]=false; }}void push_up(int rt){ color[rt]=(color[rt<<1]|color[rt<<1|1]);}void push_down(int rt){ if(lazy[rt]){ lazy[rt<<1]=lazy[rt<<1|1]=lazy[rt]; color[rt<<1]=color[rt<<1|1]=color[rt]; lazy[rt]=false; }}void update(int rt,int L,int R,int c,int sl,int sr){ if(sl<=L&&sr>=R) { color[rt]=0x00000001<<(c-1); lazy[rt]=true; } else { int M=(L+R)>>1; push_down(rt); if(sl<=M) update(lson,c,sl,sr); if(sr>M) update(rson,c,sl,sr); push_up(rt); }}void query(int rt,int L,int R,int ql,int qr){ if(ql<=L&&qr>=R) { get(color[rt]); } else { int M=(L+R)>>1; push_down(rt); if(ql<=M)query(lson,ql,qr); if(qr>M) query(rson,ql,qr); }}int main(){ while(~scanf("%d%d",&N,&Q)&&(N+Q)) { build(1,1,N); for(int i=0; i<Q; i++) { int a,b,c; char op; scanf("\n%c",&op); if(op=='P') { scanf("%d%d%d",&a,&b,&c); if(a>b) {int temp=a;a=b;b=temp;} update(1,1,N,c,a,b); } else { scanf("%d%d",&a,&b); if(a>b) {int temp=a;a=b;b=temp;} memset(vis,false,sizeof(vis)); query(1,1,N,a,b); int cnt=0; for(int i=0; i<30; i++) { cnt+=vis[i]; } int sum=0; for(int i=0;i<30;i++){ if(vis[i]){ sum++; printf("%d",i+1); if(sum==cnt)printf("\n"); else printf(" "); } } } } } return 0;}
0 0
- A Corrupt Mayor's Performance Art+线段树区间更新查询
- hdoj5023A Corrupt Mayor's Performance Art【线段树区间更新】
- HDU 5023 A Corrupt Mayor's Performance Art(线段树区间更新)
- hdu 5023 A Corrupt Mayor's Performance Art (线段树+区间更新+状压)
- hdu 5023 A Corrupt Mayor's Performance Art(线段树区间更新)
- HDU 5023 A Corrupt Mayor's Performance Art(线段树区间更新)
- HDU 5023 A Corrupt Mayor's Performance Art (线段树区间更新,入门详解)
- hdu5023 A Corrupt Mayor's Performance Art(线段树+区间更新)
- HDU 5023 - A Corrupt Mayor's Performance Art(线段树区间更新+状态压缩)
- hdu 5023 A Corrupt Mayor's Performance Art 广州网络赛 线段树的区间覆盖+种类查询
- 【HDU】5023 A Corrupt Mayor's Performance Art 线段树
- 【线段树】 HDU 5025 A Corrupt Mayor's Performance Art
- hdu 5023 A Corrupt Mayor's Performance Art(线段树)
- HDU5023 A Corrupt Mayor's Performance Art 【线段树】
- HDU5023 - A Corrupt Mayor's Performance Art(线段树)
- HDU 5023 A Corrupt Mayor's Performance Art (线段树)
- A Corrupt Mayor's Performance Art (线段树+二进制压缩)
- HDU 5023 A Corrupt Mayor's Performance Art 线段树 区间染色
- lua
- 关于01背包的问题
- OpenGL入门系列6 - 累积缓冲区用法例子
- 不归零法编码、曼彻斯特编码和差分曼彻斯特编码
- 指针与数组
- A Corrupt Mayor's Performance Art+线段树区间更新查询
- Ubuntu 14.04 samba安装
- 空气颗粒度PM2.5的检测设计与实现
- HDU 5023 A Corrupt Mayor's Performance Art(线段树+优美的位运算)
- 互联网协议入门(二)
- 正则表达式例子
- CSDN用户博客准则1
- Mysql 笔记
- 【ALearning】第五章 Android相关组件介绍(二)Service