Submission #686683

#	Time	Username	Problem	Language	Result	Execution time	Memory
686683		speedyArda	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	30 / 100	1457 ms	90692 KiB

sortbooks

#include "bits/stdc++.h"

using namespace std;
using ll = long long;
const ll MAXN = 4e6 + 5;

ll seg[MAXN * 4];

void update(ll v, ll tl, ll tr, ll pos, ll val)
{

    if(tl == tr)
    {
        seg[v] = max(seg[v], val);
        return;
    }
    ll tm = (tl + tr) / 2;
        
    if(pos <= tm)
        update(2 * v, tl, tm, pos, val);
    else
        update(2 * v + 1, tm + 1, tr, pos, val);
    seg[v] = max(seg[v * 2], seg[v * 2 + 1]);

}

ll get(ll v, ll tl, ll tr, ll l, ll r)
{
    if(l > r)
        return 0;
    if(l == tl && r == tr)
    {
        return seg[v];
    }
    ll tm = (tl + tr) / 2;

    return max(get(2 * v, tl, tm, l, min(r, tm)), get(2 * v + 1, tm + 1, tr, max(tm + 1, l), r));
}

int main() 
{
    ios_base::sync_with_stdio(0);
    ll n, m;
    cin >> n >> m;
    ll w[n+5];
    for(ll i = 1; i <= n; i++)
        cin >> w[i];
    vector< vector < pair<pair<ll, ll>, ll> > > q(m+5);

    for(ll i = 1; i <= m; i++)
    {
        ll l, r, k;
        cin >> l >> r >> k;
        q[l].push_back({{r, k}, i});
    }
    ll ans[m+5];
    vector<ll> curr;
    for(ll i = n; i >= 1; i--)
    {
        while(!curr.empty() && w[curr.back()] <= w[i])
        {
            if(w[curr.back()] != w[i])
                update(1, 1, n, curr.back(), w[curr.back()] + w[i]);
            curr.pop_back();
        }
        curr.push_back(i);
        for(pair< pair<ll, ll>, ll> elem : q[i])
        {
            ll temp = get(1, 1, n, i, elem.first.first);
            if(temp <= elem.first.second)
                ans[elem.second] = 1;
            else
                ans[elem.second] = 0;
        }
    }


    for(ll i = 1; i <= m; i++)
        cout << ans[i] << "\n";

}

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