count color线段树java_POJ 2777 Count Color ---线段树

Count Color

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 6   Accepted Submission(s) : 1

Problem 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

1 /*

2 功能Function Description: POJ 2777 线段树3 开发环境Environment: DEV C++ 4.9.9.14 技术特点Technique:5 版本Version:6 作者Author: 可笑痴狂7 日期Date: 201208088 备注Notes:9 题意：10 给定一个长度为N(N <= 100000)的数列Si，紧接着Q(Q <= 100000)条操作，操作11 形式有两种：12 1. "C A B C" 将A到B的数都染成C这种颜色。13 2. "P A B" 输出A和B之间不同颜色的数目。14

15

16 解法：-------转17 线段树(染色问题)18

19 思路：20 一看到数据量就可以首先确定是线段树了，经典的区间染色问题，涉及到区间的21 更新和询问，和pku 3468 类似，巧妙运用lazy思想。就是每次更新区间段的时候延迟22 更新，只是在完全覆盖的区间打上一个lazy标记。这题的询问是求区间段中不同颜色的23 数量，因为颜色数不多只有30种，可以巧妙运用二进制位运算，用一个int就可以表示24 当前区间段的颜色情况。比如1001表示有两种颜色，如果左子树的当前颜色情况是10125 ，而右子树的颜色情况是011，那么父亲的颜色情况就是两者的位或，这样就可以避免26 掉重复的情况。27 再来谈谈lazy思想。做了这么多的线段树，应该总结一下，lazy是一个很经典的思28 想。所谓lazy，就是懒惰，每次不想做太多，只要插入的区间完全覆盖了当前结点所管29 理的区间就不再往下做了，在当前结点上打上一个lazy标记，然后直接返回。下次如果30 遇到当前结点有lazy标记的话，直接传递给两个儿子，自己的标记清空。这样做肯定是31 正确的。我们以染色为例，可以这样想，如果当前结点和它的子孙都有lazy标记的话，32 必定是子孙的先标记，因为如果是自己先标记，那么在访问子孙的时候，必定会将自己33 的标记下传给儿子，而自己的标记必定会清空，那么lazy标记也就不存在了。所以可以34 肯定，当前的lazy标记必定覆盖了子孙的，所以直接下传即可，不需要做任何判断。当35 然，这是染色问题，是直接赋值的，如果像pku 3468那样，每次是区间加和，则传递标36 记的时候不能简单的赋值，必须累加，这是显而易见的。37 */

38

39

40 //这是仿照别人写的AC代码

41 #include

42

43 structnode44 {45 intlc,rc;46 int state; //用二进制的每一位中的1的个数来标记颜色的个数

47 int id; //标记状态看是否被完全覆盖

48 }tree[300010];49

50

51 void build(int s,int t,intT)52 {53 intmid;54 tree[T].lc=s;55 tree[T].rc=t;56 if(s==t)57 return;58 mid=(s+t)>>1;59 build(s,mid,T<<1);60 build(mid+1,t,(T<<1)|1); //位运算，等价于build(mid+1,t,(T<<1)+1);

61 }62

63 void insert(int s,int t,int T,int value) //从s到t涂上颜色value，从T节点开始查找

64 {65 intmid;66 if(tree[T].lc==s&&tree[T].rc==t) //说明涂色范围正好完全覆盖T所包含的区域，直接更新颜色信息，下边的节点不用管

67 {68 tree[T].id=1; //标记为完全覆盖

69 tree[T].state=1<

70 return;71 }72 if(tree[T].id) //说明T是完全覆盖的，更新T孩子节点的信息

73 {74 tree[T].id=0;75 tree[T<<1].id=tree[(T<<1)|1].id=1;76 tree[T<<1].state=tree[(T<<1)|1].state=tree[T].state;77 }78 mid=(tree[T].lc+tree[T].rc)>>1;79 if(t<=mid)80 insert(s,t,T<<1,value);81 else if(s>mid)82 insert(s,t,(T<<1)|1,value);83 else

84 {85 insert(s,mid,T<<1,value);86 insert(mid+1,t,(T<<1)|1,value);87 }88 tree[T].state=(tree[T<<1].state)|(tree[T<<1|1].state);//等同于把颜色数相加

89 if(tree[T<<1].id&&tree[(T<<1)|1].id&&tree[T<<1].state==tree[(T<<1)|1].state)90 tree[T].id=1;91 }92

93 int qurry(int s,int t,int T) //从T节点开始查询区间s到t颜色的个数

94 {95 intmid;96 if(tree[T].lc==s&&tree[T].rc==t)97 returntree[T].state;98 if(tree[T].id) //减枝----说明T是全覆盖的直接返回状态值即可

99 returntree[T].state;100 mid=(tree[T].lc+tree[T].rc)>>1;101 if(t<=mid)102 return qurry(s,t,T<<1);103 else if(s>mid)104 return qurry(s,t,(T<<1)|1);105 else

106 return qurry(s,mid,T<<1)|qurry(mid+1,t,(T<<1)|1);107 }108

109 intmain()110 {111 inti,j,k,color,t,num,len,m;112 char cmd[2];113 while(scanf("%d%d%d",&len,&color,&m)!=EOF)114 {115 build(1,len,1);116 tree[1].state=1;117 tree[1].id=1;118 while(m--)119 {120 scanf("%s",cmd);121 if(cmd[0]=='C')122 {123 scanf("%d%d%d",&i,&j,&k);124 if(i>j)125 {126 t=i;127 i=j;128 j=t;129 }130 insert(i,j,1,k);131 }132 else

133 {134 scanf("%d%d",&i,&j);135 if(i>j)136 {137 t=i;138 i=j;139 j=t;140 }141 k=qurry(i,j,1);142 num=0;143 for(i=0;i