Count Color[poj2777]

Count Color

Time Limit: 1000MS  Memory Limit: 65536K
Total Submissions: 17921  Accepted: 5194

 

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

 

题意:

读入L(长度),T(颜色总数),O(操作次数)

注意,T的范围只有30，所以可以用二进制数记录节点包括哪些颜色

另外注意标记下传...因为我用当前节点的父亲下传至当前节点 所以wa了几次

正确的应该是当该节点有效时(纯色)下传至儿子点

 

{ Source Code Problem: 2777 User: hccz95 Memory: 2896K Time: 391MS Language: Pascal Result: Accepted Source Code } const maxn = 100000 ; var tree : array[ 0..maxn*4 ] of record color , kinds : Longint end; n , color , m : Longint ; procedure insert( v , L , R , a , b , c : Longint ); var m , Ls , Rs : Longint ; begin if ( L = a ) and ( R = b ) then begin tree[ v ].color := c ; tree[ v ].kinds := 1 << ( c - 1 ) ; exit; end; m := ( L + R ) >> 1 ; Ls := v << 1 ; Rs := Ls + 1 ; if tree[ v ].color <> maxlongint then begin tree[ Ls ] := tree[ v ] ; tree[ Rs ] := tree[ v ] ; end; if b <= m then insert( Ls , L , m , a , b , c ) else if a > m then insert( Rs , m+1 , R , a , b , c ) else begin insert( Ls , L , m , a , m , c ); insert( Rs , m+1 , R , m+1 , b , c ); end; if tree[ Ls ].color <> tree[ Rs ].color then begin tree[ v ].color := maxlongint ; tree[ v ].kinds := tree[ Ls ].kinds or tree[ Rs ].kinds ; end else if tree[ Ls ].color <> maxlongint then tree[ v ] := tree[ Ls ] else begin tree[ v ].color := maxlongint ; tree[ v ].kinds := tree[ Ls ].kinds or tree[ Rs ].kinds ; end; end; function count( v , L , R , a , b : Longint ) : Longint ; var m , Ls , Rs : Longint ; begin if tree[ v ].color <> maxlongint then exit( tree[ v ].kinds ); m := ( L + R ) >> 1 ; Ls := v << 1 ; Rs := Ls + 1 ; if b <= m then exit( count( Ls , L , m , a , b ) ); if a > m then exit( count( Rs , m+1 , R , a , b ) ); exit( count( Ls , L , m , a , m ) or count( Rs , m+1 , R , m+1 , b ) ); end; function get( x : Longint ) : Longint ; begin x := (x and $55555555) + ((x shr 1) and $55555555); x := (x and $33333333) + ((x shr 2) and $33333333); x := (x and $0F0F0F0F) + ((x shr 4) and $0F0F0F0F); x := (x and $00FF00FF) + ((x shr 8) and $00FF00FF); x := (x and $0000FFFF) + ((x shr 16) and $0000FFFF); exit( x ); end; procedure main; var i , a , b , c : Longint ; ch : Char ; begin readln( n , color , m ); for i := 1 to n do insert( 1 , 1 , n , i , i , 1 ); tree[ 0 ].color := maxlongint ; for i := 1 to m do begin read( ch ); if ch = 'P' then begin readln( a , b ); if a > b then begin c := a ; a := b ; b := c ; end; writeln( get( count( 1 , 1 , n , a , b ) ) ); end else begin read( a , b ); if a > b then begin c := a ; a := b ; b := c ; end; readln( c ); insert( 1 , 1 , n , a , b , c ); end; end; end; begin main; end.