B - A Corrupt Mayor's Performance Art

---

题目描述：

B - A Corrupt Mayor’s Performance Art
Time Limit:1000MS Memory Limit:100000KB 64bit IO Format:%I64d & %I64u
Submit

Status

Practice

HDU 5023
Appoint description:
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

题解：

本来是水题,但是比赛时一直T…(因为把颜色分开算了30次)
线段树来维护这一段一共都有什么值,用一个int状压就好啦,没有什么不可写的

重点：

线段树维护一段区间的信息.

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>

using namespace std;

const int maxn = 1e6 + 100;
const int MAX_NODE = 4*maxn;
int tree[MAX_NODE], tag[MAX_NODE];

void pushUp(int rt)
{
    int lrt = (rt<<1), rrt = lrt+1;
    tree[rt] = (tree[lrt] | tree[rrt]);
}
void pushDown(int rt, int l, int r)
{
    int lrt = (rt<<1), rrt = lrt+1, m = (l+r)/2;
    if(tag[rt] == -1)
        return;
    int t = tag[rt];
    tag[lrt] = tag[rrt] = t;
    tree[lrt] = (1<<t);
    tree[rrt] = (1<<t);

    tag[rt] = -1;
}
void initail(int rt, int l, int r)
{
    tag[rt] = -1;
    if(l == r)
    {
        tree[rt] = (1<<2);
        return;
    }
    tree[rt] = (1<<2);
    int lrt = (rt<<1), rrt = lrt+1, m = (l+r)/2;
    initail(lrt, l, m);
    initail(rrt, m+1, r);
}
void change(int L, int R, int key, int rt, int l, int r)
{
    if(L <= l && R >= r)
    {
        tag[rt] = key;
        tree[rt] = (1<<key);
        return;
    }
    pushDown(rt, l, r);
    int lrt = (rt<<1), rrt = lrt+1, m = (l+r)/2;
    if(L <= m)
        change(L, R, key, lrt, l, m);
    if(R >= m+1)
        change(L, R, key, rrt, m+1, r);
    pushUp(rt);
}
int query(int L, int R, int rt, int l, int r)
{
    if(L <= l && R >= r)
    {
        return tree[rt];
    }
    pushDown(rt, l, r);
    int sum = 0;
    int lrt = (rt<<1), rrt = lrt+1, m = (l+r)/2;
    if(L <= m)
        sum |= query(L, R, lrt, l, m);
    if(R >= m+1)
        sum |= query(L, R, rrt, m+1, r);
    return sum;
}
int n, m;
int a[maxn], b[maxn], color[maxn], flag[maxn];
int vis[31];
void solve()
{
    initail(1, 1, n);
    for(int i = 1; i<=m; i++)
    {
        if(flag[i] == 2)
        {
            int t = query(a[i], b[i], 1, 1, n);
            int first = 1;
            for(int i = 1; i<=30; i++)
            {
                if(t&(1<<i))
                {
                  if(first)
                  {
                   printf("%d", i);
              first = 0;
                  }
else
{
    printf(" %d", i);
}

                }
            }
            printf("\n");
        }
        else
        {
            change(a[i], b[i], color[i], 1, 1, n);
        }
    }
}

int main()
{
   // freopen("Bin.txt", "r", stdin);
    while(scanf("%d%d", &n, &m) != EOF)
    {
        if(n==0 && m == 0)
            break;
        memset(vis,0,sizeof vis);
        char ch[2];
        int aa, bb, cc;
        for(int i = 1; i<=m; i++)
        {
            scanf("%s", ch);
            if(ch[0] == 'P')
            {
                flag[i] = 1;
                scanf("%d%d%d", &aa, &bb, &cc);
                a[i] = aa;
                b[i] = bb;
                color[i] = cc;
                vis[cc] = 1;
            }
            else
            {
                flag[i] = 2;
                scanf("%d%d", &aa, &bb);
                a[i] = aa;
                b[i] = bb;
            }
        }
        //printf("%dmmm \n", m);
        solve();
    }
    return 0;
}