牛客15567 统计颜色

链接

点击跳转

题解

在线段树节点上维护一个64位整数，每一位分别表示每种颜色是否出现过

利用计算机的并行性，这个题的时间复杂度可以做到$O(nlogn)$

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#define drep(i,a,b) for(i=a;i>=b;i--)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
struct SegmentTree
{
    ll now[maxn], tag[maxn<<2], L[maxn<<2], R[maxn<<2];
    void maketag(ll o, ll v)
    {
        now[o]|=v;
        tag[o]|=v;
    }
    void pushdown(ll o)
    {
        if(L[o]==R[o])return;
        if(tag[o])
        {
            maketag(o<<1,tag[o]);
            maketag(o<<1|1,tag[o]);
            tag[o]=0;
        }
    }
    void pushup(ll o)
    {
        now[o] = now[o<<1] | now[o<<1|1];
    }
    void build(ll o, ll l, ll r)
    {
        ll mid(l+r>>1);
        L[o]=l, R[o]=r;
        tag[o]=0;
        now[o]=0;
        if(l==r)
        {
            return;
        }
        build(o<<1,l,mid);
        build(o<<1|1,mid+1,r);
        pushup(o);
    }
    void Add(ll o, ll l, ll r, ll v)
    {
        ll mid(L[o]+R[o]>>1);
        if(l<=L[o] and r>=R[o]){maketag(o,v);return;}
        pushdown(o);
        if(l<=mid)Add(o<<1,l,r,v);
        if(r>mid)Add(o<<1|1,l,r,v);
        pushup(o);
    }
    ll Q(ll o, ll l, ll r)
    {
        pushdown(o);
        ll mid(L[o]+R[o]>>1), ans(0);
        if(l<=L[o] and r>=R[o])return now[o];
        if(l<=mid)ans|=Q(o<<1,l,r);
        if(r>mid)ans|=Q(o<<1|1,l,r);
        return ans;
    }
}segtree;
int main()
{
    ll n, m;
    while(~scanf("%lld%lld",&n,&m))
    {
        segtree.build(1,1,n);
        while(m--)
        {
            ll type=read();
            if(type==1)
            {
                ll l=read(), r=read(), c=read();
                segtree.Add(1,l,r,1ll<<c);
            }
            else
            {
                ll l=read(), r=read();
                ll ans = segtree.Q(1,l,r);
                printf("%d\n",__builtin_popcountll(ans));
            }
        }
    }
    return 0;
}