题目大意
给出一个序列,一开始都是数字 1 1 1代表第一种颜色,最多有 30 30 30种颜色,现在有两种操作:
- 1 x y c o l 1~~x~~y~~col 1 x y col:将区间 [ x , y ] [x,y] [x,y]的气球都变成颜色 c o l col col
- 1 x y 1~~x~~y 1 x y:查询区间内不同颜色的气球个数
解题思路
类似 H D U 1698 HDU1698 HDU1698,将区间变成同一个颜色和将区间的数都变成同一个数是相同的,原来的加法都变为赋值即可。然后就是区间颜色个数的查询,因为颜色最多只有三十种,可以使用状压保存每种颜色的状态,那么只要 i n t int int数组即可。小区间合并为大区间的颜色显然需要与运算,查询答案时也全部都是与运算。最后使用 g + + g++ g++自带的函数 _ _ b u i l t i n _ p o p c o u n t ( i n t n ) \_\_builtin\_popcount(int~~n) __builtin_popcount(int n)统计答案二进制 1 1 1的个数。
注意修改查询区间的左边界和右边界可能反着给
//
// Created by Happig on 2020/11/2
//
#include <iostream>
#include <cstdio>
#include <math.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define ins insert
#define Vector Point
#define ENDL "\n"
#define lowbit(x) (x&(-x))
#define mkp(x, y) make_pair(x,y)
#define mem(a, x) memset(a,x,sizeof a);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const double dinf = 1e300;
const ll INF = 1e18;
const int Mod = 1e9 + 7;
const int maxn = 1e5 + 10;
int tree[maxn << 2], lz[maxn << 2];
void build(int i, int l, int r) {
if (l == r) {
tree[i] = 1;
return;
}
int mid = (l + r) >> 1, k = i << 1;
build(k, l, mid);
build(k | 1, mid + 1, r);
tree[i] = tree[k] | tree[k | 1];
}
void pushdown(int i, int l, int r) {
int mid = (l + r) >> 1, k = i << 1;
tree[k] = lz[i], tree[k | 1] = lz[i];
lz[k] = lz[k | 1] = lz[i], lz[i] = 0;
}
void upd(int i, int l, int r, int x, int y, int col) {
if (l == x && r == y) {
tree[i] = lz[i] = col;
return;
}
if (lz[i]) pushdown(i, l, r);
int mid = (l + r) >> 1, k = i << 1;
if (y <= mid) upd(k, l, mid, x, y, col);
else if (x > mid) upd(k | 1, mid + 1, r, x, y, col);
else upd(k, l, mid, x, mid, col), upd(k | 1, mid + 1, r, mid + 1, y, col);
tree[i] = tree[k] | tree[k | 1];
}
int query(int i, int l, int r, int x, int y) {
if (l == x && r == y) {
return tree[i];
}
if (lz[i]) pushdown(i, l, r);
int mid = (l + r) >> 1, k = i << 1;
if (y <= mid) return query(k, l, mid, x, y);
else if (x > mid) return query(k | 1, mid + 1, r, x, y);
else return query(k, l, mid, x, mid) | query(k | 1, mid + 1, r, mid + 1, y);
}
int main() {
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
//ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int n, m, q;
char op;
scanf("%d %d %d", &n, &m, &q);
build(1, 1, n);
int x, y, z;
while (q--) {
getchar();
scanf("%c", &op);
if (op == 'C') {
scanf("%d %d %d", &x, &y, &z);
if (x > y) swap(x, y);
upd(1, 1, n, x, y, 1 << z - 1);
} else {
scanf("%d %d", &x, &y);
if (x > y) swap(x, y);
int ans = query(1, 1, n, x, y);
printf("%d\n", __builtin_popcount(ans));
}
}
return 0;
}