poj2777 Count Color
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.
Ouput results of the output operation in order, each line contains a number.
with tree[p] do
if (l=b) and (r=e) then
color:=1 shl (c-1);
if cover then
m:=(l+r) div 2;
if e<=m then ins(p*2,b,e,c) else
if b>m then ins(p*2+1,b,e,c) else
color:=tree[p*2].color or tree[p*2+1].color;