Submission #1202849

#	Time	Username	Problem	Language	Result	Execution time	Memory
1202849		hoa208	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	0 / 100	1128 ms	116320 KiB

sortbooks

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, b, a) for (int i = (b), _a = (a); i >= _a; i--)
#define pa pair<ll, ll>
#define fi first
#define se second
#define bit(mask, j) ((mask >> j) & 1)
#define t_test int t;cin >> t;while(t--)
const   ll mod = 1e9 + 7;
const   ll INF = 1e18;
inline  void adm(ll &x){if(x>=mod)x%=mod;else if(x<0)x+=mod;}
//--------------------------------------------------------------------
const ll N = 1e6 + 10;
ll n, a[N], nxt[N], q;
ll t[4 * N], st[4 * N], lazy[4 * N];
void build(ll id = 1, ll l = 1, ll r = n) {
    if(l == r) {
        t[id] = a[l];
        return;
    }
    ll mid = l + r >> 1;
    build(id << 1, l, mid);
    build(id << 1 | 1, mid + 1, r);
    t[id] = max(t[id << 1], t[id << 1 | 1]);
}
void down(ll id) {
    if(lazy[id] == 0) return;
    st[id << 1] = max(lazy[id], st[id << 1]);
    st[id << 1 | 1] = max(lazy[id], st[id << 1 | 1]);
    lazy[id << 1] = max(lazy[id], lazy[id << 1]);
    lazy[id << 1 | 1] = max(lazy[id], lazy[id << 1 | 1]);
    lazy[id] = 0;
}
void update(ll u, ll v, ll val, ll id = 1, ll l = 1, ll r = n) {
    if(u > r || v < l) return;
    if(u <= l && v >= r) {
        st[id] = max(st[id], val);
        lazy[id] = max(lazy[id], val);
        return;
    }
    ll mid = l + r >> 1;
    down(id);
    update(u, v, val, id << 1, l, mid);
    update(u, v, val, id << 1 | 1, mid + 1, r);
    st[id] = max(st[id << 1], st[id << 1 | 1]);
}
ll get(ll u, ll v, ll id = 1, ll l = 1, ll r = n) {
    if(u > r || v < l) return 0;
    if(u <= l && v >= r) {
        return st[id] + t[id];
    }
    ll mid = l + r >> 1;
    down(id);
    return max(get(u, v, id << 1, l, mid), get(u, v, id << 1 | 1, mid + 1, r));
}
struct state {
    ll r, k, id;
};
vector<state> qr[N];
bool ans[N];
void hbmt() {
    cin >> n >> q;
    FOR(i, 1, n) cin >> a[i];
    build();
    stack<ll> st;
    st.push(n + 1);
    a[n + 1] = INF;
    FOR(i, 1, q) {
        ll l, r, k;
        cin >> l >> r >> k;
        qr[l].push_back({r, k, i});
    }
    FORD(i, n, 1) {
        while(!st.empty() && a[st.top()] < a[i]) st.pop();
        update(i + 1, st.top() - 1, a[i]);
        st.push(i);
        for(auto e : qr[i]) {
            ans[e.id] = (get(i + 1, e.r) <= e.k); 
        }
    }
    FOR(i, 1, q) cout << ans[i] << '\n';
}

int main() {
    
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    
    if(fopen("hbmt.inp", "r")) {
        freopen("hbmt.inp", "r", stdin);
        freopen("hbmt.ans", "w", stdout);
    }
    
    // t_test 
    hbmt();
    return 0;
}

Compilation message (stderr)

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:92:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   92 |         freopen("hbmt.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:93:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |         freopen("hbmt.ans", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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