| Count Color
| Time Limit: 1000MS |
|
Memory Limit: 65536K |
| Total Submissions: 54359 |
|
Accepted: 16337 |
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
Source POJ Monthly--2006.03.26,dodo |
[Submit] [Go Back] [Status] [Discuss]
Home Page 
Go Back 
To top
题意：操作1：将区间 a - b 都变成 c
操作2：找出区间 a - b 的种类个数。
题解：变成二进制分析要变成某个值的颜色，将该结点更新为 (1<<(vel-1)，初始全为 1。
坑点：1， a 不一定比 b 小；
2，记得将 v[](下拉标记清0）
#include
#include
