统计颜色—牛客

 

一个很裸的线段树板子题，因为球的数量为60，可以用二进制来保存状态，并运算来合并区间。

区间修改，要用懒标记

然后用lowbit求答案O(logn)的

注意:该题是多组测试数据

#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
typedef long long LL;

struct Node
{
    int l, r;
    LL s, add;
}tr[N * 4];

void pushup(int u)
{
    tr[u].s = tr[u << 1].s | tr[u << 1 | 1].s;
}

void pushdown(int u)
{
    if (tr[u].add)
    {
        tr[u << 1].add |= tr[u].add, tr[u << 1].s |= tr[u].add;
        tr[u << 1 | 1].add |= tr[u].add, tr[u << 1 | 1].s |= tr[u].add;
        tr[u].add = 0;
    }
}

void build(int u, int l, int r)
{
    tr[u] = {l, r, 0, 0};
    if (l != r)
    {
        int mid = l + r >> 1;
        build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
        pushup(u);
    }
}

void modify(int u, int l, int r, int c)
{
    if (tr[u].l >= l && tr[u].r <= r) tr[u].s |= 1LL << c, tr[u].add |= 1LL << c;
    else
    {
        pushdown(u);
        int mid = tr[u].l + tr[u].r >> 1;
        if (l <= mid) modify(u << 1, l, r, c);
        if (r > mid) modify(u << 1 | 1, l, r, c);
        pushup(u);
    }
}

Node query(int u, int l, int r)
{
    if (tr[u].l >= l && tr[u].r <= r) return tr[u];
    else
    {
        pushdown(u);
        int mid = tr[u].l + tr[u].r >> 1;
        if (r <= mid) return query(u << 1, l, r);
        else if (l > mid) return query(u << 1 | 1, l, r);
        else
        {
            Node res;
            auto left = query(u << 1, l, r);
            auto right = query(u << 1 | 1, l, r);
            res.s = left.s | right.s;
            return res;
        }
    }
    
    return {};
}

LL lowbit(LL x)
{
    return x & -x;
}

int transfer(LL x)
{
    int res = 0;
    for (LL i = x; i; i -= lowbit(i)) res ++;
    
    return res;
}

int main()
{
    int n, m;
    while (cin >> n >> m)
    {  
        build(1, 1, n);
        while (m --)
        {
            int op, l, r, c;
            cin >> op >> l >> r;
            if (op == 1)
            {
                cin >> c;
                modify(1, l, r, c);
            }
            else cout << transfer(query(1, l, r).s) << endl; 
        } 
    }

    
}