solution-code2660

1
#include <iostream>
2
#include <cstdio>
3
#include <cstring>
4
#include <algorithm>
5
using namespace std;
6
struct Tree
7
{
8
  int L,R,col;
9
}T[400005];
10
inline void pushdown(int v)
11
{
12
  if(T[v].col!=-1)
13
  {
14
    T[v<<1].col=T[(v<<1)|1].col=T[v].col;
15
    T[v].col=-1;
16
  }
17
  return;
18
}
19
inline void Build(int L,int R,int v)
20
{
21
  T[v].L=L;T[v].R=R;
22
  T[v].col=1;
23
  if(L==R)return;
24
  int mid=(L+R)>>1;
25
  Build(L,mid,v<<1);
26
  Build(mid+1,R,(v<<1)|1);
27
  return;
28
}
29
inline void Insert(int L,int R,int col,int v)
30
{
31
  if(L>T[v].R||R<T[v].L)return;
32
  if(L<=T[v].L&&R>=T[v].R)
33
  {
34
    T[v].col=col;
35
    return;
36
  }
37
  pushdown(v);
38
  Insert(L,R,col,v<<1);
39
  Insert(L,R,col,(v<<1)|1);
40
  return;
41
}
42
inline long long Query(int L,int R,int v)
43
{
44
  if(L>T[v].R||R<T[v].L)return 0;
45
  if(T[v].col!=-1)return 1LL<<T[v].col;
46
  return Query(L,R,v<<1)|Query(L,R,(v<<1)|1);
47
}
48
int main(void)
49
{
50
  int i,n,m,k,ch,L,R,v;
51
  scanf("%d%d%d",&n,&k,&m);
52
  Build(1,n,1);
53
  while(m--)
54
  {
55
    while(ch=getchar())if(ch=='C'||ch=='P')break;
56
    scanf("%d%d",&L,&R);
57
    if(ch=='C')
58
    {
59
      scanf("%d",&v);
60
      Insert(L,R,v,1);
61
    }
62
    else printf("%d\n",__builtin_popcount(Query(L,R,1)));
63
  }
64
  return 0;
65
}