Submission #333705

#	Time	Username	Problem	Language	Result	Execution time	Memory
333705		vipghn2003	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	100 / 100	1892 ms	94700 KiB

sortbooks

#include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
using namespace std;

const int N=1e6+5;
int n,m,a[N];

struct Query
{
    int l,r,k;
}q[N];
vector<int>event[N];
vector<int>val;

int ST[4*N];

int get (int id,int l,int r,int L,int R)
{
    if (r<L||R<l) return -1e9;
    if (L<=l&&r<=R) return ST[id];
    int mid=(l+r)/2;
    return max (get (id*2,l,mid,L,R),get (id*2+1,mid+1,r,L,R));
}

void update(int id,int l,int r,int u,int x)
{
    if(r==l&&l==u)
    {
        ST[id]=max(ST[id],x);
        return;
    }
    if(u>r||u<l) return;
    int mid=(l+r)/2;
    update(id*2,l,mid,u,x);
    update(id*2+1,mid+1,r,u,x);
    ST[id]=max(ST[id*2],ST[id*2+1]);
}


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=m;i++)
    {
        cin>>q[i].l>>q[i].r>>q[i].k;
        event[q[i].r].push_back(i);
    }
    vector<pii>vec;
    stack<int>st;
    for(int i=1;i<=n;i++)
    {
        while(!st.empty()&&a[st.top()]<=a[i]) st.pop();
        if(!st.empty()) vec.push_back(mp(i,st.top()));
        st.push(i);
    }
    sort(vec.begin(),vec.end());
    int j=0;
    vector<int>res(m+1);
    for(int i=1;i<=n;i++)
    {
        while(j<vec.size()&&vec[j].fi<=i)
        {
            update(1,1,n,vec[j].se,a[vec[j].fi]+a[vec[j].se]);
            j++;
        }
        for(auto&id:event[i])
        {
            int l=q[id].l;
            int r=q[id].r;
            int k=q[id].k;
            if(get(1,1,n,l,n)<=k) res[id]=1;
            else res[id]=0;
        }
    }
    for(int i=1;i<=m;i++) cout<<res[i]<<'\n';
}

Compilation message (stderr)

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:67:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |         while(j<vec.size()&&vec[j].fi<=i)
      |               ~^~~~~~~~~~~
sortbooks.cpp:75:17: warning: unused variable 'r' [-Wunused-variable]
   75 |             int r=q[id].r;
      |                 ^

• Subtask 1: 8 / 8
• Subtask 2: 9 / 9
• Subtask 3: 13 / 13
• Subtask 4: 17 / 17
• Subtask 5: 30 / 30
• Subtask 6: 23 / 23