oj.uz

Submission #1097255

# Submission time Handle Problem Language Result Execution time Memory
1097255 2024-10-06T15:18:07 Z anhthi Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
0 / 100
 819 ms 62812 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define fi first
#define se second
#define ll long long
#define mp(x, y) make_pair(x, y)
#define sz(v) ((int) (v).size())
#define all(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define BIT(x, y) (((x) >> (y)) & 1)
#define pb push_back
#define max_rng *max_element
#define min_rng *min_element
#define rep(i, n) for(int i = 1, _n = (n); i <= _n; ++i)
#define forn(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i)
#define ford(i, a, b) for(int i = (a), _b = (b); i >= _b; --i)
 
template <class X, class Y>
    inline bool maximize(X &x, Y y) {
        return (x < y ? x = y, true : false);
    }
 
template <class X, class Y>
    inline bool minimize(X &x, Y y) {
        return (x > y ? x = y, true : false);
    }
 
template <class X>
    inline void compress(vector<X> &a) {
        sort(all(a));
        a.resize(unique(all(a)) - a.begin());
    }
 
int ctz(ll x) { return __builtin_ctzll(x); }
int lg(ll x) { return 63 - __builtin_clzll(x); }
int popcount(ll x) { return __builtin_popcount(x); }
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) {
    return l + abs((ll) rng()) % (r - l + 1);
}
 
const ll oo = (ll) 1e17;
const int inf = (ll) 1e9 + 7, mod = (ll) 1e9 + 7;
 
const int N = 1e6 + 5, M = 2e5 + 5, BASE = 307, LOG = 23;
 
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 n, m;
int a[N];

struct node {
    int Max, Min, res;
    node() {};
    node(int a, int b, int c) {
        Max = a; Min = b; res = c;
    }
};

struct Seg {
    int n;
    vector<node> st;

    Seg(int n) : n(n) {
        st.resize(n << 2);
        build(1, 1, n);
    }

    node combine(node x, node y) {
        node res;
        res.res = max(x.res, y.res);
        res.Max = max(x.Max, y.Max);
        res.Min = min(x.Min, y.Min);
        if (x.Max > y.Min)
            maximize(res.res, x.Max + y.Min);
        if (x.Min > y.Max)
            maximize(res.res, x.Min + y.Max);
        return res;
    }

    void build(int i, int l, int r) {
        if (l == r) {
            st[i] = {a[l], a[l], l};
            return;
        }
        int m = (l + r) >> 1;
        build(2 * i, l, m);
        build(2 * i + 1, m + 1, r);
        st[i] = combine(st[2 * i], st[2 * i + 1]);
    }

    node get(int i, int l, int r, int u, int v) {
        if (l > v || r < u) return node(-inf, inf, 0);
        if (l >= u && r <= v) return st[i];
        int m = (l + r) >> 1;
        return combine(get(2 * i, l, m, u, v), get(2 * i + 1, m + 1, r, u, v));
    }

    node get(int u, int v) { return get(1, 1, n, u, v); }

};

int main(void) {
 
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    cin >> n >> m;
    rep(i, n) cin >> a[i];


    Seg s(n);
    rep(_, m) {
        int l, r, k;
        cin >> l >> r >> k;

        cout << (s.get(l, r).res <= k) << '\n';

    }

 
    return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 819 ms 62812 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 57 ms 5968 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -