Submission #1123165

#	Time	Username	Problem	Language	Result	Execution time	Memory
1123165		gdragon	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	100 / 100	1766 ms	61388 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
#define TASK "long"
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define GETBIT(mask, i) ((mask) >> (i) & 1)
#define MASK(i) ((1LL) << (i))
#define SZ(x) ((int)(x).size())
#define mp make_pair
#define CNTBIT(mask) __builtin_popcount(mask)
template<class X, class Y> bool maximize(X &x, Y y){ if (x < y) {x = y; return true;} return false;};
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y) {x = y; return true;} return false;};
typedef pair<int, int> ii;
const int N = 1e6 + 5;
const int inf = 1e9 + 7;
const long long INF = (long long)1e18 + 7;
const int mod = 1e9 + 7;
void add(int &x, int y) {x += y; if (x >= mod) x -= mod;}
void sub(int &x, int y) {x -= y; if (x < 0) x += mod;}
int mul(int x, int y) {return 1LL * x * y % mod;}
// -----------------------------------------//
struct Fenwick {
    int n;
    vector<int> v;
    Fenwick(int _n = 0) {
        n = _n;
        v.assign(n + 2, 0);
    }
    void update(int x, int c) {
        for(; x > 0; x -= x & -x) v[x] = max(v[x], c);
    }
    int getMax(int x) {
        int ans = 0;
        for(; x <= n; x += x & -x) ans = max(ans, v[x]);
        return ans;
    }
} fw;
int n, q;
int a[N], val[N], ans[N];
vector<ii> queries[N];
void read() {
    cin >> n >> q;
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 1; i <= q; i++) {
        int l, r; cin >> l >> r >> val[i];
        queries[r].push_back({l, i});
    }
}
void solve() {
    fw = Fenwick(n);
    stack<int> st;
    for(int r = 1; r <= n; r++) {
        while(!st.empty() && a[st.top()] <= a[r]) st.pop();
        if (!st.empty()) {
            fw.update(st.top(), a[st.top()] + a[r]);
        }
        st.push(r);
        for(auto [l, id]: queries[r]) ans[id] = fw.getMax(l);
    }
    for(int i = 1; i <= q; i++) {
        cout << (ans[i] <= val[i] ? 1 : 0) << endl;
    }
}
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }
    int test = 1;
    // cin >> test;
    while(test--) {
        read();
        solve();
    }
    return 0;
}

Compilation message (stderr)

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

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