【POJ Count Color】 线段树 区间查询

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

题意：若干操作给每个区间染色，然后问查询区间内有多少种不同颜色

思路：

题目本身是一道挺典型的线段树例题。把种类求和转化成到二进制上每一个位上1的个数。因为T数据量比较小，所以可以在二进制上30个位上填1，代表某一种颜色。然后区间求和就变成求区间内的或和，因为这样可以将区间内所有点的二进制数值上的1整合到一起，有多少个1就对应多少种颜色。不过写的时候还是没注意到一些细节WA了好几次，吸取经验。

#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <cmath>
#include <string>
#include <map>
#include <algorithm>
#define maxn 210000+500
using namespace std;
typedef long long ll;
ll n,t,m;
typedef struct Tree
{
   
    ll l;
    ll r;
    ll sum;
    ll lazy;
} T;
T a[maxn<<2];

void update(ll k)
{
   
    a[k].sum = a[k<<1].sum | a[k