题意==我有一个画板和好多好多画笔(好吧,最多也就30个),一开始我的画板上有L(1 <= L <= 100000)个小格子,并且颜色都是1。然后我就要开始画画了,我能画O (1 <= O <= 100000)笔(或者提问)
1.C A B C 我要把从A-B之间的所有格子都涂成C颜色
2.P A B 我要问问从A-B之间有多少种颜色
思路:成段更新+状态压缩(因为只有最多30种颜色,所以int就行了)
成段更新有一个神奇的东西叫做延迟标记,就是比如说我把1-5的格子全都涂成5颜色,然后我就只把1-5的线段的lazy和color涂成5,注意:是线段不是点,只有当我下次再涂或者问到的时候遇到1-5之间的任意格子才把这个lazy数组往下标记就是把1-2,3-5涂成颜色5和lazy=5,以此类推……………….
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<queue>
#include<stack>
#include<string>
#include<vector>
#include<map>
#include<set>
using namespace std;
#define rfor(i,a,b) for(i=a;i<=b;++i)
#define lfor(i,a,b) for(i=a;i>=b;--i)
#define sfor(i,a,h) for(i=h[a];i!=-1;i=e[i].next)
#define mem(a,b) memset(a,b,sizeof(a))
#define mec(a,b) memcpy(a,b,sizeof(b))
#define cheak(i) printf("%d ",i)
#define min(a,b) (a>b?b:a)
#define max(a,b) (a>b?a:b)
#define inf 0x7fffffff
typedef long long LL;
#define maxn 100005
struct node
{
int lazy,color;
}tree[maxn*4];
void build(int l,int r,int index)
{
tree[index].lazy=-1;
tree[index].color=1;
if(l==r) return ;
int mid=(l+r)/2;
build(l,mid,index*2);
build(mid+1,r,index*2+1);
}
void fun1(int index)
{
tree[index*2].color=tree[index].lazy;
tree[index*2+1].color=tree[index].lazy;
tree[index*2].lazy=tree[index*2+1].lazy=tree[index].lazy;
tree[index].lazy=-1;
}
void insert(int l,int r,int left,int right,int col,int index)
{
//printf("%d %d %d %d %d\n",l,r,left,right,tree[index]);
if(left<=l&&r<=right)
{
tree[index].lazy=col;
tree[index].color=col;
return ;
}
if(tree[index].lazy!=-1)
fun1(index);
int mid=(l+r)/2;
if(left>mid)
insert(mid+1,r,left,right,col,index*2+1);
else if(right<=mid)
insert(l,mid,left,right,col,index*2);
else
{
insert(l,mid,left,right,col,index*2);
insert(mid+1,r,left,right,col,index*2+1);
}
tree[index].color=tree[index*2].color|tree[index*2+1].color;
}
int query(int l,int r,int left,int right,int index)
{
if(left<=l&&r<=right)
{
return tree[index].color;
}
if(tree[index].lazy!=-1)
{
fun1(index);
}
int mid=(l+r)/2;
if(left>mid)
return query(mid+1,r,left,right,index*2+1);
else if(right<=mid)
return query(l,mid,left,right,index*2);
else
{
int sum;
sum=query(l,mid,left,right,index*2);
sum|=query(mid+1,r,left,right,index*2+1);
return sum;
}
}
int fun(int x)
{
int ans=0;
while(x)
{
if(x&1) ans++;
x/=2;
}
return ans;
}
int main()
{
int i,m,k,n,a,b,c;
char str[5];
while(~scanf("%d%d%d",&m,&k,&n))
{
build(1,m,1);
rfor(i,1,n)
{
scanf("%s%d%d",str,&a,&b);
if(a>b) swap(a,b);
if(str[0]=='P')
printf("%d\n",fun(query(1,m,a,b,1)));
else
{
scanf("%d",&c);
// printf("%d %d %d\n",a,b,c);
c=1<<c-1;
insert(1,m,a,b,c,1);
}
}
}
return 0;
}