提出 #72561318

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
const int maxn = 2e5 + 5;

class SegmentTree
{
public:
    long long a[200 * maxn], add[200 * maxn];
    bitset<200*maxn> f0;
    int cnt = 1, ls[200 * maxn], rs[200 * maxn], root[200 * maxn]; //ls左儿子，ls右儿子，root为根

    inline void push_up(int rt) //向上更新
    {
        a[rt] = max(a[ls[rt]], a[rs[rt]]);
    }
    void build(int l,int r,int &rt)
    {
        if (!rt)
        {
            rt=cnt;
            cnt++;
        }
        if (l==r)
            return;
        int mid=l+r>>1;
        build(l,mid,ls[rt]);
        build(mid+1,r,rs[rt]);
    }
    inline void push_down(int rt, int l, int r) //向下更新
    {
        if (f0[rt])
        {
            if (ls[rt])
            {
                a[ls[rt]] = 0;
                add[ls[rt]]= 0;
                f0[ls[rt]]=1;
            }
            if (rs[rt])
            {
                a[rs[rt]] = 0;
                add[rs[rt]] =0;
                f0[rs[rt]]=1;
            }
            f0[rt]=0;
        }
        if (add[rt] != 0)
        {
            if (ls[rt])
            {
                add[ls[rt]] += add[rt];
                a[ls[rt]] += add[rt];
            }
            if (rs[rt])
            {
                add[rs[rt]] += add[rt];
                a[rs[rt]] += add[rt];
            }

            add[rt] = 0;
        }
    }

    void updata1(int x, int y, long long k, int l, int r, int &rt) //线段树区间为从l到r，把区间x到y每个数+k
    {
        if (!rt)
            return;
        if (x <= l && y >= r)
        {
            a[rt] += k;
            add[rt] += k;
            return;
        }
        push_down(rt, l, r);
        int mid = (l + r) / 2;
        if (x <= mid)
            updata1(x, y, k, l, mid, ls[rt]);
        if (y > mid)
            updata1(x, y, k, mid + 1, r, rs[rt]);
        push_up(rt);
    }

    void updata2(int x, int y, int l, int r, int &rt) //线段树区间为从l到r，把区间x到y每个数+k
    {
        if (!rt)
            return;
        if (x <= l && y >= r)
        {
            a[rt] =0;
            add[rt] =0;
            f0[rt]=1;
            return;
        }
        push_down(rt, l, r);
        int mid = (l + r) / 2;
        if (x <= mid)
            updata2(x, y, l, mid, ls[rt]);
        if (y > mid)
            updata2(x, y, mid + 1, r, rs[rt]);
        push_up(rt);
    }

    long long query(int x, int y, int l, int r, int rt) //线段树区间为从l到r，询问区间x到y的和
    {
        if (!rt)
            return 0;
        if (x <= l && y >= r)
            return a[rt];
        push_down(rt, l, r);
        int mid = (l + r) / 2;
        long long ans = 0;
        if (x <= mid)
            ans = query(x, y, l, mid, ls[rt]);
        if (y > mid)
            ans = max(ans, query(x, y, mid + 1, r, rs[rt]));
        return ans;
    }


    void split(int &p, int &q, int x, int y, int l, int r) //将p中x到y的区间分裂给q
    {
        if (!p)
            return;
        if (x <= l && r <= y)
        {
            q = p;
            p = 0;
            return;
        }
        if (!q)
        {
            q = cnt;
            cnt++;
        }
        push_down(p,l,r);
        push_down(q,l,r);
        int mid = l + r >> 1;
        if (x <= mid)
            split(ls[p], ls[q], x, y, l, mid);
        if (y > mid)
            split(rs[p], rs[q], x, y, mid + 1, r);
        push_up(p);
        push_up(q);
    }
} st;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, q;
    cin >> n >> q;
    st.build(1,n,st.root[1]);

    while (q--)
    {
        int op, l, r;
        cin >> op >> l >> r;
        if (op == 1)
        {
            long long x;
            cin >> x;
            st.updata1(l,r,x,1,n,st.root[1]);
        }
        else if (op==2)
        {
            st.updata2(l,r,1,n,st.root[1]);
            st.split(st.root[1],st.root[3],l,r,1,n);
            st.split(st.root[2],st.root[1],l,r,1,n);
            st.split(st.root[3],st.root[2],l,r,1,n);
        }
        else
        {
            print("{}\n",st.query(l,r,1,n,st.root[1]));
        }

    }
}

提出情報

コンパイルエラー

./Main.cpp: In member function 'void SegmentTree::build(int, int, int&)':
./Main.cpp:28:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   28 |         int mid=l+r>>1;
      |                 ~^~
./Main.cpp: In member function 'void SegmentTree::push_down(int, int, int)':
./Main.cpp:32:39: warning: unused parameter 'l' [-Wunused-parameter]
   32 |     inline void push_down(int rt, int l, int r) //向下更新
      |                                   ~~~~^
./Main.cpp:32:46: warning: unused parameter 'r' [-Wunused-parameter]
   32 |     inline void push_down(int rt, int l, int r) //向下更新
      |                                          ~~~~^
./Main.cpp: In member function 'void SegmentTree::split(int&, int&, int, int, int, int)':
./Main.cpp:140:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  140 |         int mid = l + r >> 1;
      |                   ~~^~~

ジャッジ結果