luogu 1558 色板游戏

  1 /***********************
  2 User:Mandy.H.Y
  3 Language:c++
  4 Problem:
  5 Algorithm:
  6 ***********************/
  7 
  8 #include<bits/stdc++.h>
  9 #define lson l,mid,k<<1
 10 #define rson mid + 1,r,k<<1|1
 11 
 12 using namespace std;
 13 
 14 const int maxn = 1e5 + 5;
 15 
 16 int n,t,o,ans;
 17 bool tree[maxn << 2];
 18 int colo[maxn << 2];
 19 
 20 template<class T>inline void read(T &x){
 21     x = 0;bool flag = 0;char ch = getchar();
 22     while(!isdigit(ch)) flag |= ch == ‘-‘,ch = getchar();
 23     while(isdigit(ch)) x = (x << 1) + (x << 3) + (ch^ 48),ch = getchar();
 24     if(flag) x = -x;
 25 } 
 26 
 27 template<class T>void putch(const T x){
 28     if(x > 9) putch(x / 10);
 29     putchar(x % 10 | 48);
 30 }
 31 
 32 template<class T>void put(const T x){
 33     if(x < 0) putchar(‘-‘),putch(-x);
 34     else putch(x);
 35 }
 36 
 37 void file(){
 38     freopen("testdata(2).in","r",stdin);
 39     freopen("1558.out","w",stdout);
 40 }
 41 
 42 void buildtree(int l,int r,int k){
 43     tree[k] = 1;colo[k] = 2;
 44     if(l == r) return;
 45     int mid = (l + r) >> 1;
 46     buildtree(lson);
 47     buildtree(rson);
 48 }
 49 
 50 void readdata(){
 51     read(n);read(t);read(o);
 52     buildtree(1,n,1);
 53 }
 54 
 55 void pushdown(int k){
 56     if(tree[k] == 1){
 57         tree[k<<1] = 1;
 58         tree[k<<1|1] = 1;
 59         colo[k<<1] = colo[k];
 60         colo[k<<1|1] = colo[k];
 61     }
 62 }
 63 
 64 void modify(int l,int r,int k,int x,int y,int color){
 65     if(x <= l && r <= y){
 66         tree[k] = 1;//tree用于标记是否为单一色彩 
 67         colo[k] = (1 << color);
 68         return;
 69     }
 70     int mid = (l + r) >> 1;
 71     pushdown(k);//%%% 
 72     if(x <= mid) modify(lson,x,y,color);
 73     if(y > mid) modify(rson,x,y,color);
 74     colo[k] = colo[k<<1] | colo[k<<1|1];//状态压缩存颜色 
 75     if((colo[k<<1] != colo[k<<1|1]) || (tree[k<<1] == 0) || (tree[k<<1|1] == 0)) tree[k] = 0;
 76     //%%% 注意 三个条件 
 77 }
 78 
 79 void query(int l,int r,int k,int x,int y){
 80     if(x <= l && r <= y){
 81         ans |= colo[k];
 82         return;
 83     }
 84     pushdown(k);//%%% 
 85     int mid = (l + r) >> 1;
 86     if(x <= mid) query(lson,x,y);
 87     if(y > mid) query(rson,x,y);
 88 }
 89 
 90 void work(){
 91     while(o--){
 92         char c = getchar();
 93         int l,r,x;
 94         while(c != ‘C‘ && c != ‘P‘) c = getchar();
 95         if(c == ‘C‘) {
 96             read(l);read(r);read(x);
 97             if(l > r) swap(l,r);
 98             modify(1,n,1,l,r,x);
 99         } else {
100             read(l);read(r);
101             if(l > r) swap(l,r);
102             ans = 0;
103             int num = 0;
104             query(1,n,1,l,r);
105             for(int i = ans;i;i -= (i & (-i))) ++num;//%%% 
106             put(num);
107             putchar(‘\n‘);
108         }
109     }
110 }
111 
112 int main(){
113 //    file();
114     readdata();
115     work();
116     return 0; 
117 }