Submission #1156273

#	Time	Username	Problem	Language	Result	Execution time	Memory
1156273		Faisal_Saqib	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	17 / 100	3094 ms	39112 KiB

sortbooks

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ull unsigned long long
#define vll vector<ll>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()

template<typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using maxpq = priority_queue<T, vector<T>, less<T>>;

void input(vll&q)
{
    for(auto&i:q)cin>>i;
}
void pyn(bool x)
{
    cout<<(x?"YES":"NO")<<endl;
}
void pYN(bool x)
{
    cout<<(x?"Yes":"No")<<endl;
}
void pAB(bool x)
{
    cout<<(x?"Alice":"Bob")<<endl;
}

void solve()
{
    ll n,m;
    cin>>n>>m;
    vll a(n);
    input(a);
    while(m--)
    {
        ll l,r,k;
        cin>>l>>r>>k;
        l--;
        r--;
        set<ll> cur;
        ll req=0;
        for(int i=l;i<=r;i++)
        {
            if(cur.size()>0 and (*rbegin(cur))>a[i])req=max(req,((*rbegin(cur))+a[i]));
            cur.insert(a[i]);
        }
        cout<<(k>=req)<<endl;;
    }
}

int main()
{
    int t=1;
    // cin>>t;
    while(t--)solve();
}

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