poj_2777_线段树
2013-05-02 10:27
225 查看
题目描述:
在离散段上上色。求覆盖区域的颜色有几种。
解题思路:
基础线段树的建树+修改+查询的过程。注意查询并不一定要找到区间相等,只要包含区间并且有标志颜色即可。修改函数需要注意标记下移的时候需要注意是否原先已经有标记颜色。
ps:注意,a可能大于b
代码:
#include
#include
#define L 100001
#define T 31
typedef struct{
int left, right;
int value;
}SEGNODE;
SEGNODE seg_tree[5*L];
int c[T],l,t,o;
void buildSegTree(int l, int r, int index){
seg_tree[index].left =
l;
seg_tree[index].right =
r;
seg_tree[index].value =
0;
if(l!=r){
buildSegTree(l,(l+r)/2,2*index);
buildSegTree((l+r)/2+1,r,2*index+1);
}
}
void changeSegTree(int l, int r, int index, int v){
if(seg_tree[index].left == l
&& seg_tree[index].right == r){
seg_tree[index].value = v;
}else{
if(seg_tree[index].value!=0){
seg_tree[2*index].value = seg_tree[index].value;
seg_tree[2*index+1].value = seg_tree[index].value;
seg_tree[index].value = 0;
}
if(l > (seg_tree[index].left + seg_tree[index].right)/2){
changeSegTree(l,r,2*index+1,v);
}else if(r <= (seg_tree[index].left + seg_tree[index].right)/2
){
changeSegTree(l,r,2*index,v);
}else{
changeSegTree(l,(seg_tree[index].left +
seg_tree[index].right)/2,2*index,v);
changeSegTree((seg_tree[index].left + seg_tree[index].right)/2+1,
r, 2*index+1,v);
}
}
}
void searchSegTree(int l, int r, int index){
if(l >= seg_tree[index].left && r <=
seg_tree[index].right){
if(seg_tree[index].value!=0){
c[seg_tree[index].value] = 1;
}else{
if(l > (seg_tree[index].left + seg_tree[index].right)/2){
searchSegTree(l,r,2*index+1);
}else if(r <= (seg_tree[index].left + seg_tree[index].right)/2
){
searchSegTree(l,r,2*index);
}else{
searchSegTree(l,(seg_tree[index].left +
seg_tree[index].right)/2,2*index);
searchSegTree((seg_tree[index].left +
seg_tree[index].right)/2+1,r,2*index+1);
}
}
}
}
main(){
int
i,j,x,y,color,sum,tmp;
char oper[2];
scanf("%d %d %d",&l,
&t, &o);
buildSegTree(1,l,1);
seg_tree[1].value = 1;
for(i=1;i<=o;i++){
scanf("%s",oper);
if(strcmp(oper,"C")==0){
scanf("%d %d %d",&x, &y, &color);
if(x>y){
tmp = x;
x = y;
y = tmp;
}
changeSegTree(x,y,1,color);
}else{
memset(c,0,sizeof(c));
scanf("%d %d",&x,&y);
if(x>y){
tmp = x;
x = y;
y = tmp;
}
searchSegTree(x,y,1);
sum = 0;
for(j=1;j<=t;j++)
if(c[j]==1){
sum ++;
在离散段上上色。求覆盖区域的颜色有几种。
解题思路:
基础线段树的建树+修改+查询的过程。注意查询并不一定要找到区间相等,只要包含区间并且有标志颜色即可。修改函数需要注意标记下移的时候需要注意是否原先已经有标记颜色。
ps:注意,a可能大于b
代码:
#include
#include
#define L 100001
#define T 31
typedef struct{
int left, right;
int value;
}SEGNODE;
SEGNODE seg_tree[5*L];
int c[T],l,t,o;
void buildSegTree(int l, int r, int index){
seg_tree[index].left =
l;
seg_tree[index].right =
r;
seg_tree[index].value =
0;
if(l!=r){
buildSegTree(l,(l+r)/2,2*index);
buildSegTree((l+r)/2+1,r,2*index+1);
}
}
void changeSegTree(int l, int r, int index, int v){
if(seg_tree[index].left == l
&& seg_tree[index].right == r){
seg_tree[index].value = v;
}else{
if(seg_tree[index].value!=0){
seg_tree[2*index].value = seg_tree[index].value;
seg_tree[2*index+1].value = seg_tree[index].value;
seg_tree[index].value = 0;
}
if(l > (seg_tree[index].left + seg_tree[index].right)/2){
changeSegTree(l,r,2*index+1,v);
}else if(r <= (seg_tree[index].left + seg_tree[index].right)/2
){
changeSegTree(l,r,2*index,v);
}else{
changeSegTree(l,(seg_tree[index].left +
seg_tree[index].right)/2,2*index,v);
changeSegTree((seg_tree[index].left + seg_tree[index].right)/2+1,
r, 2*index+1,v);
}
}
}
void searchSegTree(int l, int r, int index){
if(l >= seg_tree[index].left && r <=
seg_tree[index].right){
if(seg_tree[index].value!=0){
c[seg_tree[index].value] = 1;
}else{
if(l > (seg_tree[index].left + seg_tree[index].right)/2){
searchSegTree(l,r,2*index+1);
}else if(r <= (seg_tree[index].left + seg_tree[index].right)/2
){
searchSegTree(l,r,2*index);
}else{
searchSegTree(l,(seg_tree[index].left +
seg_tree[index].right)/2,2*index);
searchSegTree((seg_tree[index].left +
seg_tree[index].right)/2+1,r,2*index+1);
}
}
}
}
main(){
int
i,j,x,y,color,sum,tmp;
char oper[2];
scanf("%d %d %d",&l,
&t, &o);
buildSegTree(1,l,1);
seg_tree[1].value = 1;
for(i=1;i<=o;i++){
scanf("%s",oper);
if(strcmp(oper,"C")==0){
scanf("%d %d %d",&x, &y, &color);
if(x>y){
tmp = x;
x = y;
y = tmp;
}
changeSegTree(x,y,1,color);
}else{
memset(c,0,sizeof(c));
scanf("%d %d",&x,&y);
if(x>y){
tmp = x;
x = y;
y = tmp;
}
searchSegTree(x,y,1);
sum = 0;
for(j=1;j<=t;j++)
if(c[j]==1){
sum ++;
相关文章推荐
- POJ 2777 Count Color 暑假 —— 线段树1 ——H
- 线段树模板 poj2777
- POJ 2777 Count Color 线段树
- POJ - 2777 Count Color(线段树 成段更新 区间查询)
- poj 2777 Count Color (线段树 区间更新 染色)
- POJ 2777--Count Color(线段树)
- POJ 2777 Count Color(线段树)
- poj_2777Count Color线段树_区间更新
- [POJ 2777]Count Color[线段树区间更新查询]
- POJ-2777 Count Color(线段树,区间染色问题)
- 线段树。。。POJ 2777
- POJ-2777 Count Color(线段树)
- poj 2777 Count Color 基础线段树,带给的初学者噩梦!!!
- 【POJ 2777 】 线段树之成段更新+位运算
- POJ 2777 Count Color (线段树区间更新 位压缩)
- 线段树区间染色 浮水法 学习小记 Poj 2777 + Poj 2528
- POJ 2777 线段树
- poj 2777 Count Color(线段树 Lazy-Tag思想 成段更新+区间统计)
- POJ 2777 Count Color 线段树无位运算
- POJ 2777 Count Color(线段树染色,二进制优化)