【POJ 2777】 Count Color

【题目链接】

http://poj.org/problem?id=2777

【算法】

线段树

【代码】

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <limits>
#include <list>
#include <map>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <vector>
#include <cwchar>
#include <cwctype>
#include <stack>
#include <limits.h>
using namespace std;
#define MAXN 100010

int N,T,Q,l,r,x,v;
char op[];

struct SegmentTree
{
        struct Node
        {
                int l,r,s,tag;
        } Tree[MAXN<<];
        inline void build(int index,int l,int r)
        {
                Tree[index].l = l;
                Tree[index].r = r;
                Tree[index].s = ;
                if (l == r) return;
                int mid = (l + r) >> ;
                build(index<<,l,mid);
                build(index<<|,mid+,r);
        }
        inline void pushdown(int index)
        {
                if (Tree[index].tag)
                {
                        Tree[index<<].s = Tree[index<<|].s =  << (Tree[index].tag - );
                        Tree[index<<].tag = Tree[index<<|].tag = Tree[index].tag;
                        Tree[index].tag = ;
                }
        }
        inline void update(int index)
        {
                Tree[index].s = Tree[index<<].s | Tree[index<<|].s;
        }
        inline void modify(int index,int l,int r,int val)
        {
                if (Tree[index].l == l && Tree[index].r == r)
                {
                        Tree[index].s =  << (val - );
                        Tree[index].tag = val;
                        return;
                }
                pushdown(index);
                int mid = (Tree[index].l + Tree[index].r) >> ;
                if (mid >= r) modify(index<<,l,r,val);
                else if (mid +  <= l) modify(index<<|,l,r,val);
                else
                {
                        modify(index<<,l,mid,val);
                        modify(index<<|,mid+,r,val);
                }
                update(index);
        }
        inline int query(int index,int l,int r)
        {
                if (Tree[index].l == l && Tree[index].r == r) return Tree[index].s;
                pushdown(index);
                int mid = (Tree[index].l + Tree[index].r) >> ;
                if (mid >= r) return query(index<<,l,r);
                else if (mid +  <= l) return query(index<<|,l,r);
                else return query(index<<,l,mid) | query(index<<|,mid+,r);
        }
} S;
inline int calc(int x)
{
        int ret = ;
        while (x)
        {
                if (x & ) ret++;
                x >>= ;
        }
        return ret;
}

int main()
{

        scanf("%d%d%d",&N,&T,&Q);
        S.build(,,N);
        while (Q--)
        {
                scanf("%s",&op);
                if (op[] == 'C')
                {
                      scanf("%d%d%d",&l,&r,&x);
                      if (l > r) swap(l,r);
                      S.modify(,l,r,x);
                }    else
                {
                        scanf("%d%d",&l,&r);
                        if (l > r) swap(l,r);
                        v = S.query(,l,r);
                        printf("%d\n",calc(v));
                }
        }

        return ;

}