HDU - 5023 A Corrupt Mayor's Performance Art 普普通通的线段树

题意：刷一面宽度为n的墙，初始颜色为2。m次操作，

P a b c：区间[a , b]的墙刷成c颜色，

Q a b：按字典序输出[a , b]上有的颜色。

颜色1~30，30种。

 

本来考虑压位方法，用int的每一位记录30种不同的颜色，但感觉状压不用也可以，就先写个这个普通的线段树，不过再说. . . . . .然而它过了. . . →_→

那就这样吧~

树用递归操作，树结点记录该结点所代表区间的颜色，为零表示颜色不唯一，不设延迟标记，代码如下：

 

#include <cstring>
#include <iostream>

#define maxn 1250000
using namespace std;

int tre[maxn<<2];  //tre结点为0表示颜色不唯一，不为0则表示该结点代表的区间颜色全为tre[i]
int col[31];    //color数组用于每次查询时 记录颜色

void Update(int L,int R,int c,int l,int r,int i) //修改区间[L,R]为颜色c，tre[i]结点代表区间[l,r]
{
	if(L<=l&&r<=R) 
	{
		tre[i]=c;
		return;
	}
	if(tre[i]) //在修改之前 将颜色下推一层。
	{        //为省时间颜色不会下推到叶，因此部分颜色不会被覆盖，一个点的颜色由树的更高层决定，无视低层颜色信息
		tre[i<<1]=tre[i];
		tre[i<<1|1]=tre[i];
		tre[i]=0; //因此注意清零父结点，否则其子树颜色信息将被屏蔽，对子树信息修改将没有意义
	}
	int m=(l+r)>>1;
	if(L<=m) Update(L,R,c,l,m,i<<1);
	if(R>m) Update(L,R,c,m+1,r,i<<1|1);
}

void Query(int L,int R,int l,int r,int i)//查询区间[L,R]，tre[i]结点代表区间[l,r]
{
	if(tre[i])//碰到有颜色的结点直接记录返回，无视子树信息
	{
		col[tre[i]]=1;
		return;
	}
	int m=(l+r)>>1;
	if(L<=m) Query(L,R,l,m,i<<1);
	if(R>m) Query(L,R,m+1,r,i<<1|1);
}

int main()
{
	int n,m,i,j,a,b,c;
	char s;
	while(cin>>n>>m&&(n||m))
	{
		memset(tre,0,sizeof(tre));
		tre[1]=2;    //代表初始时墙[1,n]全为颜色2
		for(i=1;i<=m;i++)
		{
			cin>>s;
			if(s=='P')
			{
				scanf("%d%d%d",&a,&b,&c);
				Update(a,b,c,1,n,1);
			}
			else
			{
				scanf("%d%d",&a,&b);
				memset(col,0,sizeof(col));//color清零
				Query(a,b,1,n,1);
				for(j=1;!col[j];j++);//输出 结尾不带空格
				cout<<j;
				for(j++;j<=30;j++) if(col[j]) cout<<' '<<j;
				cout<<endl;
			}
		}
	}
	return 0;
}

 

 

 

 

A Corrupt Mayor's Performance Art

 

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 100000/100000 K (Java/Others)
Total Submission(s): 2862    Accepted Submission(s): 1018

 

 

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?

 

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.

 

 

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