POJ2777(线段树涂色问题)

Count Color

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 42828		Accepted: 12973

Description

Chosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get a new problem.

There is a very long board with length L centimeter, L is a positive integer, so we can evenly divide the board into L segments, and they are labeled by 1, 2, ... L from left to right, each is 1 centimeter long. Now we have to color the board - one segment with only one color. We can do following two operations on the board:

1. "C A B C" Color the board from segment A to segment B with color C. 
2. "P A B" Output the number of different colors painted between segment A and segment B (including).

In our daily life, we have very few words to describe a color (red, green, blue, yellow…), so you may assume that the total number of different colors T is very small. To make it simple, we express the names of colors as color 1, color 2, ... color T. At the beginning, the board was painted in color 1. Now the rest of problem is left to your.

Input

First line of input contains L (1 <= L <= 100000), T (1 <= T <= 30) and O (1 <= O <= 100000). Here O denotes the number of operations. Following O lines, each contains "C A B C" or "P A B" (here A, B, C are integers, and A may be larger than B) as an operation defined previously.

Output

Ouput results of the output operation in order, each line contains a number.

Sample Input

2 2 4
C 1 1 2
P 1 2
C 2 2 2
P 1 2

Sample Output

2
1

思路：因为只有30种颜色，所以可以用2进制数颜色。
注意：l可能大于r

#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN = ;
struct Node{
    int l, r;
    int color;
    bool lazy;
}a[MAXN*];
int n, t, m, tag;
void build(int rt, int l, int r)
{
    a[rt].l = l;
    a[rt].r = r;
    a[rt].lazy = false;
    if(l == r)
    {
        a[rt].color = ;
        return ;
    }
    int mid = (l + r) >> ;
    build(rt << , l, mid);
    build((rt << ) | , mid + , r);
    a[rt].color = a[rt<<].color | a[(rt<<)|].color;
}
void pushDown(int rt)
{
    if(a[rt].lazy)
    {
        a[rt<<].color = a[rt].color;
        a[(rt<<)|].color = a[rt].color;
        a[rt<<].lazy = a[rt].lazy;
        a[(rt<<)|].lazy = a[rt].lazy;
        a[rt].lazy = false;
    }
}
void update(int rt, int l, int r, int val)
{
    if(a[rt].l == l && a[rt].r == r)
    {
        a[rt].color =  << (val - );
        a[rt].lazy = true;
        return ;
    }
    pushDown(rt);
    int mid = (a[rt].l + a[rt].r) >> ;
    if(r <= mid)
    {
        update(rt << , l, r, val);
    }
    else if(mid < l)
    {
        update((rt << ) | , l, r, val);
    }
    else
    {
        update(rt << , l, mid, val);
        update((rt << ) | , mid + , r, val);
    }
    a[rt].color = a[rt<<].color | a[(rt<<)|].color;
}
void query(int rt, int l, int r)
{
    if(a[rt].l == l && a[rt].r == r)
    {
        tag |= a[rt].color;
        return ;
    }
    pushDown(rt);
    int mid = (a[rt].l + a[rt].r) >> ;
    if(r <= mid)
    {
        query(rt << , l, r);
    }
    else if(mid < l)
    {
        query((rt << ) | , l, r);
    }
    else
    {
        query(rt << , l, mid);
        query((rt << ) | , mid + , r);
    }
}
int main()
{
    while(scanf("%d %d %d", &n, &t, &m) != EOF)
    {
        build(, , n);
        while(m--)
        {
            char op;
            scanf("%*c%c", &op);
            if(op == 'C')
            {
                int l, r, val;
                scanf("%d %d %d", &l, &r, &val);
                if(l > r)   swap(l, r);
                update(, l, r, val);
            }
            else
            {
                int l, r;
                scanf("%d %d", &l, &r);
                if(l > r)   swap(l, r);
                tag = ;
                query(, l, r);
                int res = ;
                while(tag > )
                {
                    if(tag & )
                    {
                        res++;
                    }
                    tag >>= ;
                }
                printf("%d\n", res);
            }
        }
    }
    return ;
}