Submission #919219

#	Time	Username	Problem	Language	Result	Execution time	Memory
919219		Whisper	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	64 / 100	142 ms	25296 KiB

sortbooks

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll>;

#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int N, Q;
int a[MAX];
//l(i) là thằng gần nhất > a(i) về bên trái mà a(i) + a(l(i)) > K

int leftMost[MAX];

vector<array<int, 3>> que[MAX];
int f[MAX];
void modify(int p, int val){
    for ( ; p > 0; p -= p & (-p)) maximize(f[p], val);
}
int query(int p){
    int res = 0;
    for ( ; p <= N; p += p & (-p)) maximize(res, f[p]);
    return res;
}
int ans[MAX];
void Whisper(){
    cin >> N >> Q;
    for (int i = 1; i <= N; ++i) cin >> a[i];
    stack<int> st;
    for (int i = 1; i <= N; ++i){
        while (st.size() && a[st.top()] <= a[i]) st.pop();
        if (st.size()) leftMost[i] = st.top();
        st.push(i);
    }
    for (int i = 1; i <= Q; ++i){
        int l, r, k; cin >> l >> r >> k;
        que[r].push_back({l, k, i});
    }
    for (int r = 1; r <= N; ++r){
        if (leftMost[r] > 0) modify(leftMost[r], a[leftMost[r]] + a[r]);
        for (auto&[l, k, id] : que[r]){
            ans[id] = (query(l) <= k);
        }
    }
    FOR(i, 1, Q) cout << ans[i] << "\n";
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

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