http://poj.org/problem?id=2777
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
#%#%#%#%#%#%#%#%#%#%#%#%#%#%#%#%#%#%#%#%#%
#include<stdio.h>
#include<string.h>
#define NN 100008
int color[35];
struct node
{
int l,r,cor;
}g[NN*4];
void build_tree(int l,int r,int h)
{
g[h].l=l,g[h].r=r;g[h].cor=1;//初始化为1；
if(l==r)return;
int mid=(l+r)/2;
build_tree(l,mid,h+h);
build_tree(mid+1,r,h+h+1);
}
void update(int l,int r,int h,int add)
{
if(add==g[h].cor)//当颜色相同时返回；
return;
if(l==g[h].l&&r==g[h].r)
{
g[h].cor=add;//直接覆盖；
return;
}
if(g[h].cor>0)
{
g[h+h].cor=g[h+h+1].cor=g[h].cor;
g[h].cor=-1;
}
int mid=(g[h].l+g[h].r)/2;
if(r<=mid)
update(l,r,h+h,add);
else if(l>mid)
update(l,r,h+h+1,add);
else
{
update(l,mid,h+h,add);
update(mid+1,r,h+h+1,add);
}
}
void quire(int l,int r,int h)
{
if(g[h].cor>0)
{
color[g[h].cor]=1;
return;
}
/*if(g[h].cor>0)
{
g[h+h].cor=g[h+h+1].cor=g[h].cor;
g[h].cor=-1;
}*/
int mid=(g[h].l+g[h].r)/2;
if(r<=mid)
quire(l,r,h+h);
else if(l>mid)
quire(l,r,h+h+1);
else
{
quire(l,mid,h+h);
quire(mid+1,r,h+h+1);
}
}
int main()
{
int i,j,k,m,n,aa,bb,cc;
char ss[20];
while(scanf("%d%d%d",&m,&n,&k)!=EOF)
{
build_tree(1,m,1);
while(k--)
{
scanf("%s",ss);
if(ss[0]=='P')
{
scanf("%d%d",&aa,&bb);
if(aa>bb)
aa^=bb^=aa^=bb;
memset(color,0,sizeof(color));
quire(aa,bb,1);
int sum=0;
for(i=0;i<31;i++)
{
if(color[i])
sum++;
}
printf("%d\n",sum);
}
else
{
scanf("%d%d%d",&aa,&bb,&cc);
if(aa>bb)
aa^=bb^=aa^=bb;
update(aa,bb,1,cc);
}
}
}
return 0;
}
