POJ 2777 Count Color
题意:对区间[1, L]有两种操作:(1)C A B C染区间[A, B]为颜色C. (2)P A B输出区间[A, B]有多少颜色。初始的时候整个区间都是颜色1. 一共有T种颜色,并且T <= 30.
思路:
-
tree[ ] == 0:该区间没有颜色(在这个题中其实不存在)
-
tree[ ] == x(x 是某个整数):该区间只有一个颜色:颜色号为x
-
tree[ ] == -1:该区间有多种颜色
-
查询时,如果tree[rt] == 0,那就直接return 0; 如果tree[rt] == x(x是某个整数),那就判断该颜色是否已经被统计过,如果没有就return 1,如果统计过了那就return 0. 如果tree[rt] == -1那就继续往下搜它的儿子,返回左右儿子的颜色总数
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define INF 0x3f3f3f3f
#define lowbit(x) x & (-x)
#define MID (l + r ) >> 1
#define lsn rt << 1
#define rsn rt << 1 | 1
#define Lson lsn, l, mid
#define Rson rsn, mid + 1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxN = 1e5 + 5;
int L, T, O;
//0:没有颜色 某正数:只有一种颜色 -1:多种颜色
int tree[maxN << 2], lazy[maxN << 2];
int vis[35];//某颜色是不是已经被记录过
void init()
{
memset(vis, 0, sizeof(vis));
}
void build_tree(int rt, int l, int r)
{
tree[rt] = 1;
lazy[rt] = 0;
if(l == r) return;
int mid = MID;
build_tree(Lson);
build_tree(Rson);
}
void pushup(int rt)
{
if(tree[lsn] != tree[rsn]) tree[rt] = -1;//左右儿子不一样,就是多种颜色
else tree[rt] = tree[lsn];
}
void pushdown(int rt)//覆盖
{
if(lazy[rt])
{
tree[lsn] = tree[rt]; tree[rsn] = tree[rt];
lazy[lsn] = lazy[rt]; lazy[rsn] = lazy[rt];
lazy[rt] = 0;
}
}
void update_range(int rt, int l, int r, int ql ,int qr, int val)
{
if(ql <= l && qr >= r)//被覆盖为新的颜色
{
tree[rt] = val;
lazy[rt] = val;
return ;
}
pushdown(rt);
int mid = MID;
if(qr <= mid) update_range(QL, val);
else if(ql > mid) update_range(QR, val);
else { update_range(QL, val); update_range(QR, val); }
pushup(rt);
}
int query(int rt, int l, int r, int ql, int qr)
{
if(ql <= l && qr >= r)
{
if(tree[rt] == 0) return 0;
if(tree[rt] != -1)
{
if(vis[tree[rt]]) return 0;
else { vis[tree[rt]] = 1; return 1; }
}
pushdown(rt);
int mid = MID;
return query(QL) + query(QR);
}
pushdown(rt);
int mid = MID;
if(qr <= mid) return query(QL);
else if(ql > mid) return query(QR);
else return query(QL) + query(QR);
}
int main()
{
scanf("%d%d%d", &L, &T, &O); getchar();
build_tree(1, 1, L);
while(O -- )
{
char ch[2]; scanf("%s", ch);
if(ch[0] == 'C')
{
int a, b, c; scanf("%d%d%d", &a, &b, &c);
if(a > b) swap(a, b);
update_range(1, 1, L, a, b, c);
}
else if(ch[0] == 'P')
{
int a, b; scanf("%d%d", &a, &b);
if(a > b) swap(a, b);
init();
printf("%d\n", query(1, 1, L, a, b));
}
}
return 0;
}
/*
10 10 5
P 1 10
C 1 7 10
C 1 3 7
P 1 2
P 1 10
ans: 1 1 3
*/