hdu-5023 A Corrupt Mayor's Performance Art (线段树区间修改)

今天集训队打比赛的一道题,很明显是个线段树,我们队照着lrj蓝书敲了一通,机智的将修改值和加和改成了位运算:|=

但是好像哪里出了点小问题,就是不对,赛后又水了一遍,竟然过了。。。发现还是lrj的书好啊,市面上的模板一点也不好用,连区间修改都没有 。

等集训完了要静心好好系统的学习一下线段树 。 多看多刷lrj的书 。

细节参见代码:

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1000000 + 5;
int n,m,_sum,v,a,b,y11,y22,c,setv[maxn * 3],sumv[maxn * 3];
char cmd[5];
void pushdown(int o) {
    int lc = o*2 , rc = o*2 + 1;
    if(setv[o] >= 0) {
        setv[lc] = setv[rc] = setv[o] ;
        setv[o] = -1;
    }
}
void maintain(int o,int L,int R) {

    int lc = o*2 , rc = o*2 + 1;
    sumv[o] = 0;
    if(R > L) {
        sumv[o] = sumv[lc] | sumv[rc];
    }
    if(setv[o] >= 0) { sumv[o] = setv[o]; return ; }
    return ;
}
void update(int o,int L,int R) {
    int lc = o*2 , rc = o*2 + 1;
    if(y11 <= L && y22 >= R) setv[o] = v;
    else {
        pushdown(o);
        int m = L + (R-L)/2;
        if(y11 <= m) update(lc,L,m); else maintain(lc,L,m);
        if(y22 > m) update(rc,m+1,R); else maintain(rc,m+1,R);
    }
    maintain(o,L,R);
}
void query(int o,int L,int R) {
    if(setv[o] >= 0) {
        _sum |= setv[o];
    }
    else if(y11 <= L && y22 >= R) {
        _sum |= sumv[o];
    }
    else {
        int m = L + (R-L)/2;
        if(y11 <= m) query(o*2 , L , m) ;
        if(y22 > m) query(o*2 + 1, m+1, R);
    }
}
int main() {
    while(~scanf("%d%d",&n,&m)) {
        if( !n && !m ) return 0;
        v = 2;
        y11 = 1; y22 = n;
        update(1,1,n);
        while(m--) {
            scanf("%s",cmd);
            if(cmd[0] == 'P') {
                scanf("%d%d%d",&y11,&y22,&c);
                v = (1<<(c-1));
                update(1,1,n);
            }
            else {
                scanf("%d%d",&y11,&y22);
                _sum = 0;
                query(1,1,n);
                bool ok = true;
                for(int i=0;i<30;i++)
                    if(_sum & (1<<i)) {
                        if(ok) printf("%d",i+1);
                        else printf(" %d",i+1);
                        ok = false;
                    }
                printf("\n");
            }
        }
    }
    return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

hdu-5023 A Corrupt Mayor's Performance Art (线段树区间修改)

时间: 2024-10-18 16:37:10

hdu-5023 A Corrupt Mayor's Performance Art (线段树区间修改)的相关文章

HDU 5023 A Corrupt Mayor&#39;s Performance Art 线段树区间更新+状态压缩

Link:  http://acm.hdu.edu.cn/showproblem.php?pid=5023 1 #include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <algorithm> 5 #include <vector> 6 #include <string> 7 #include <cmath> 8 using namesp

hdu 5023 A Corrupt Mayor&#39;s Performance Art(线段树区间更新)

#include<stdio.h> #include<iostream> #include<string.h> #include<algorithm> using namespace std; int tree[5001000],add[5001000]; int color[50]; int n,m; void pushup(int pos) { tree[pos]=tree[pos<<1]|tree[pos<<1|1]; //更新

hdu 5023 A Corrupt Mayor&#39;s Performance Art (线段树+区间更新+状压)

A Corrupt Mayor's Performance Art Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 100000/100000 K (Java/Others) Total Submission(s): 699    Accepted Submission(s): 267 Problem Description Corrupt governors always find ways to get dirty money.

hdu 5023 A Corrupt Mayor&#39;s Performance Art (线段树)

把求和操作改为或操作,就可以了. 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <algorithm> 5 #include <cmath> 6 #define lson l,m,rt<<1 7 #define rson m+1,r,rt<<1|1 8 using namespace std; 9 const int ma

hdu 5023 A Corrupt Mayor&#39;s Performance Art(线段树)

题目链接 题意:有一个长度 n 的序列,初始染色2,有两种操作,P x ,y ,z,区间x---y染色为z,另一种Q x,y,查询区间 x -- y 有几种颜色,并输出,会覆盖 分析:lz[]为0,表示下面颜色不统一,统一是>0; f[]表示该节点下有多少种颜色,是30种颜色的二进制表示. 刚开始做时,用1<<i 不对,不知道为什么,int的范围按理不会超的.. 1 #include <iostream> 2 #include <cstdio> 3 #includ

hdu----(5023)A Corrupt Mayor&#39;s Performance Art(线段树区间更新以及区间查询)

A Corrupt Mayor's Performance Art Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 100000/100000 K (Java/Others)Total Submission(s): 33    Accepted Submission(s): 11 Problem Description Corrupt governors always find ways to get dirty money. Pa

HDU 5023 A Corrupt Mayor&#39;s Performance Art(线段树区间更新)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5023 解题报告:一面墙长度为n,有N个单元,每个单元编号从1到n,墙的初始的颜色是2,一共有30种颜色,有两种操作: P a b c  把区间a到b涂成c颜色 Q a b 查询区间a到b的颜色 线段树区间更新,每个节点保存的信息有,存储颜色的c,30种颜色可以压缩到一个int型里面存储,然后还有一个tot,表示这个区间一共有多少种颜色. 对于P操作,依次往下寻找,找要更新的区间,找到要更新的区间之前

HDU 5023 A Corrupt Mayor&#39;s Performance Art (线段树)

A Corrupt Mayor's Performance Art Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 100000/100000 K (Java/Others) Total Submission(s): 255    Accepted Submission(s): 114 Problem Description Corrupt governors always find ways to get dirty money.

ACM学习历程—HDU 5023 A Corrupt Mayor&#39;s Performance Art(广州赛区网赛)(线段树)

Problem Description Corrupt governors always find ways to get dirty money. Paint something, then sell the worthless painting at a high price to someone who wants to bribe him/her on an auction, this seemed a safe way for mayor X to make money. Becaus

2014 网选 广州赛区 hdu 5023 A Corrupt Mayor&#39;s Performance Art

1 #include<iostream> 2 #include<cstring> 3 #include<cstdio> 4 #include<algorithm> 5 #define N 1000005 6 using namespace std; 7 8 int c[35]; 9 int tree[N*4];//正值表示该节点所管理的区间的颜色是纯色,-1表示的是非纯色 10 int n, m; 11 12 void buildT(int ld, int