Submission #50617234

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int a[maxn];
namespace segment
{
    set<pair<int,int>> st[maxn << 2];
    #define ls p << 1
    #define rs p << 1 | 1
    void build(int p,int l,int r)
    {
        if(l == r)
        {
            cin >> a[l];
            st[p].insert({a[l],-1});
            return ;
        }
        int mid = l + r >> 1;
        build(ls,l,mid);
        build(rs,mid + 1,r);
    }
    void update(int p,int l,int r,int L,int R,pair<int,int> k)
    {
        if(L <= l && r <= R)
        {
            st[p].insert(k);
            return ;
        }
        int mid = l + r >> 1;
        if(L <= mid)
        {
            update(ls,l,mid,L,R,k);
        }
        if(R > mid)
        {
            update(rs,mid + 1,r,L,R,k);
        }
    }
    void delet(int p,int l,int r,int L,int R,pair<int,int> k)
    {
        if(L <= l && r <= R)
        {
            st[p].erase(k);
            return ;
        }
        int mid = l + r >> 1;
        if(L <= mid)
        {
            delet(ls,l,mid,L,R,k);
        }
        if(R > mid)
        {
            delet(rs,mid + 1,r,L,R,k);
        }
    }
    int query(int p,int l,int r,int k)
    {
        int ans = st[p].empty() ? 0 : (*st[p].rbegin()).first;
        if(l == r)
        {
            return ans;
        }
        int mid = l + r >> 1;
        if(k <= mid)
        {
            ans = max(ans,query(ls,l,mid,k));
        }
        else
        {
            ans = max(ans,query(rs,mid + 1,r,k));
        }
        return ans;
    }
}using namespace segment;
int n,q;
int L[maxn],R[maxn],val[maxn];
int main()
{
    cin >> n;
    build(1,1,n);
    cin >> q;
    for(int i = 1;i <= q;i++)
    {
        int opt;
        cin >> opt;
        if(opt == 1)
        {
            cin >> L[i] >> R[i] >> val[i];
            update(1,1,n,L[i],R[i],make_pair(val[i],i));
        }
        else if(opt == 2)
        {
            int id;
            cin >> id;
            delet(1,1,n,L[id],R[id],make_pair(val[id],id));
        }
        else
        {
            int id;
            cin >> id;
            cout << query(1,1,n,id) << '\n';
        }
    }
    return 0;
}

Submission Info

Compile Error

Main.cpp: In function ‘void segment::build(int, int, int)’:
Main.cpp:18:21: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   18 |         int mid = l + r >> 1;
      |                   ~~^~~
Main.cpp: In function ‘void segment::update(int, int, int, int, int, std::pair<int, int>)’:
Main.cpp:29:21: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   29 |         int mid = l + r >> 1;
      |                   ~~^~~
Main.cpp: In function ‘void segment::delet(int, int, int, int, int, std::pair<int, int>)’:
Main.cpp:46:21: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   46 |         int mid = l + r >> 1;
      |                   ~~^~~
Main.cpp: In function ‘int segment::query(int, int, int, int)’:
Main.cpp:63:21: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   63 |         int mid = l + r >> 1;
      |                   ~~^~~

Judge Result