hdu 5023 A Corrupt Mayor's Performance Art 线段树

A Corrupt Mayor's Performance Art

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 100000/100000 K (Java/Others)

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 10
P 1 2 3
P 2 3 4
Q 2 3
Q 1 3
P 3 5 4
P 1 2 7
Q 1 3
Q 3 4
P 5 5 8
Q 1 5
0 0

 

Sample Output

4
3 4
4 7
4
4 7 8

 

Source

2014 ACM/ICPC Asia Regional Guangzhou Online

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi (4*atan(1.0))
#define eps 1e-14
const int N=1e6+,M=1e6+,inf=1e9+;
const ll INF=1e18+,mod=;
int tree[N*],lazy[N*];
int n,m;
void pushup(int pos)
{
    tree[pos]=(tree[pos<<]|tree[pos<<|]);
}
void pushdown(int pos)
{
    if(lazy[pos])
    {
        lazy[pos<<]=lazy[pos];
        lazy[pos<<|]=lazy[pos];
        tree[pos<<|]=(<<(lazy[pos]-));
        tree[pos<<]=(<<(lazy[pos]-));
        lazy[pos]=;
    }
}
void build(int l,int r,int pos)
{
    lazy[pos]=;
    if(l==r)
    {
        tree[pos]=;
        return;
    }
    int mid=(l+r)>>;
    build(l,mid,pos<<);
    build(mid+,r,pos<<|);
    pushup(pos);
}
void update(int L,int R,int c,int l,int r,int pos)
{
    if(L<=l&&r<=R)
    {
        lazy[pos]=c;
        tree[pos]=(<<(c-));
        return;
    }
    pushdown(pos);
    int mid=(l+r)>>;
    if(L<=mid)
        update(L,R,c,l,mid,pos<<);
    if(R>mid)
        update(L,R,c,mid+,r,pos<<|);
    pushup(pos);
}
int query(int L,int R,int l,int r,int pos)
{
    if(L<=l&&r<=R)
    {
        return tree[pos];
    }
    pushdown(pos);
    int mid=(l+r)>>;
    int ans=;
    if(L<=mid)
        ans=(ans|query(L,R,l,mid,pos<<));
    if(R>mid)
        ans=(ans|query(L,R,mid+,r,pos<<|));
    return ans;
}
char ch[];
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        if(n==&&m==)
            break;
        build(,n,);
        while(m--)
        {
            int l,r;
            scanf("%s%d%d",ch,&l,&r);
            if(ch[]=='P')
            {
                int c;
                scanf("%d",&c);
                update(l,r,c,,n,);
            }
            else
            {
                int ans=query(l,r,,n,);
                //cout<<ans<<endl;
                int flag=;
                for(int i=;i<=;i++)
                {
                    if(ans&(<<(i-)))
                    {
                        if(flag)
                            printf(" ");
                        flag++;
                        printf("%d",i);
                    }
                }
                printf("\n");
            }
        }
    }
    return ;
}