提出 #70623046

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
const int maxn = 3e5+5;
const int maxv=62;
pair<int,int> add(pair<int,int> a,pair<int,int> b)
{
    if (a.first>b.first)
        return a;
    if (a.first<b.first)
        return b;
    return {a.first,a.second+b.second};
}
class SegmentTree
{
public:
    bitset<maxv> a[maxn*4],mx[maxn*4],mn[maxn*4],cha[maxn*4],chflag[maxn*4];
    pair<int,int> ans[maxn*4];
    void upd(int rt,int loc,int k)
    {
        if (mx[rt][loc]!=k)
        {
            mx[rt][loc]=mn[rt][loc]=cha[rt][loc]=k;
            chflag[rt][loc]=1;
            if (k)
                ans[rt].first++;
            else
                ans[rt].first--;
        }
    }
    void build(int l, int r, int rt) //从l到r建立线段树
    {
        if (l == r)
        {
            ans[rt].second=1;
            return;
        }
        int mid = (l + r) >> 1;
        build(l, mid, rt * 2);
        build(mid + 1, r, rt * 2 + 1);
        push_up(rt);
    }
    void push_up(int rt) //向上更新
    {
        ans[rt]=add(ans[rt*2],ans[rt*2+1]);
        mx[rt]=mx[rt*2]|mx[rt*2+1];
        mn[rt]=mn[rt*2]&mn[rt*2+1];
    }
    void push_down(int rt, int l, int r) //向下更新
    {
        if (chflag[rt].any())
        {
            int mid = l + r >> 1;
            for (int i=0;i<maxv;i=chflag[rt]._Find_next(i))
            {
                upd(rt*2,i,cha[rt][i]);
                upd(rt*2+1,i,cha[rt][i]);
            }
            chflag[rt]=0;
        }
    }

    void updata1(int x, int y, int loc,int k,int l, int r, int rt) //线段树区间为从l到r，把区间x到y每个数+k
    {
        int mid = (l + r) >> 1;
        if (x <= l && y >= r)
        {
            if (mx[rt][loc]==mn[rt][loc])
            {
                upd(rt,loc,k);
                return;
            }
        }
        push_down(rt, l, r);
        if (x <= mid)
            updata1(x, y,  loc,k,l, mid, rt * 2);
        if (y > mid)
            updata1(x, y, loc,k, mid + 1, r, rt * 2 + 1);
        push_up(rt);
    }

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

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n,q;
    cin>>n>>q;
    st.build(1,n,1);
    while (q--)
    {
        int op,l,r;
        cin>>op>>l>>r;
        if (op==1)
        {
            int x;
            cin>>x;
            st.updata1(l,r,x,1,1,n,1);
        }
        else if (op==2)
        {
            int x;
            cin>>x;
            st.updata1(l,r,x,0,1,n,1);
        }
        else
        {
            auto ans=st.query(l,r,1,n,1);
            print("{} {}\n",ans.first,ans.second);
        }
    }
}

提出情報

コンパイルエラー

./Main.cpp: In member function 'void SegmentTree::push_down(int, int, int)':
./Main.cpp:55:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   55 |             int mid = l + r >> 1;
      |                       ~~^~~
./Main.cpp:55:17: warning: unused variable 'mid' [-Wunused-variable]
   55 |             int mid = l + r >> 1;
      |                 ^~~

ジャッジ結果