(线段树)A Corrupt Mayor's Performance Art

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5023

题意： 区间更新， 区间询问；

题解： 区间更新， 区间询问， 一共30种颜色， 可用int 来存。

地区选拔赛的一道题，当时还没怎么学线段树（只会单点更新）， 这道题只能看着别人A， 自己干着急。  今天刚看了NOS神牛的第一道区间更新就迫不及待的尝试了下。

不得不说， 题目水， 人更水TT。

最后在感慨一下， NOS神牛的代码真tm好看。

 /***Good Luck***/
 #define _CRT_SECURE_NO_WARNINGS
 #include <iostream>
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #include <string>
 #include <algorithm>
 #include <stack>
 #include <map>
 #include <queue>
 #include <vector>
 #include <set>
 #include <functional>
 #include <cmath>
 #include <numeric>

 #define Zero(a) memset(a, 0, sizeof(a))
 #define Neg(a)  memset(a, -1, sizeof(a))
 #define All(a) a.begin(), a.end()
 #define PB push_back
 #define inf 0x3f3f3f3f
 #define inf2 0x7fffffffffffffff
 #define ll long long
 using namespace std;
 //#pragma comment(linker, "/STACK:102400000,102400000")
 void get_val(int &a) {
     int value = , s = ;
     char c;
     while ((c = getchar()) == ' ' || c == '\n');
     if (c == '-') s = -s; else value = c - ;
     while ((c = getchar()) >= '' && c <= '')
         value = value *  + c - ;
     a = s * value;
 }
 #define lson l, m, rt << 1
 #define rson m + 1, r, rt << 1| 1
 const int maxn = 1e6 + ;
 int A[maxn << ];
 int n, m;
 int col[maxn << ];
 void pu(int rt) {
     A[rt] = A[rt << ] | A[rt <<  | ];
 }

 void pd(int rt) {
     if (col[rt]) {
         col[rt << ] = col[rt <<  | ] = col[rt];
         A[rt << ] = col[rt];
         A[rt <<  | ] = col[rt];
         col[rt] = ;
     }
 }

 void update(int L, int R, int v, int l, int r, int rt) {
     if (L <= l && r <= R) {
         A[rt] =  << (v - );
         col[rt] =  << (v - );
         return;
     }
     pd(rt);
     int m = (l + r) >> ;
     if (L <= m) update(L, R, v, lson);
     if (R > m) update(L, R, v, rson);
     pu(rt);
 }

 int query(int L, int R, int l, int r, int rt) {
     if (L <= l && r <= R) {
         return A[rt];
     }
     pd(rt);
     int m = (l + r) >> ;
     int ret = ;
     if (L <= m) ret |= query(L, R, lson);
     if (R > m) ret |= query(L, R, rson);
     return ret;
 }
 int main() {
     //freopen("data.out", "w", stdout);
     //freopen("data.in", "r", stdin);
     //cin.sync_with_stdio(false);
     while (scanf("%d%d", &n, &m), n|m) {
         int t = n << ;
         char q[];
         int a, b, v, ans;
         for (int i = ; i <= t; ++i) {
             A[i] = ;
             col[i] = ;
         }
         vector<int> vr;
         for (int i = ; i <= m; ++i) {
             scanf("%s", q);
             if (q[] == 'P') {
                 scanf("%d%d%d", &a, &b, &v);
                 update(a, b,v, , n, );
             } else {
                 scanf("%d%d", &a, &b);
                 ans = query(a, b, , n, );
                 for (int w = ; w <= ; ++w) {
                     if (ans & ) vr.push_back(w );
                     ans >>= ;
                 }
                 for (int w = ; w < vr.size(); ++w) printf("%d ", vr[w - ]);
                 printf("%d\n", *vr.rbegin());
                 vr.clear();
             }
         }
     }
     return ;
 }