Submission #873892

#	Time	Username	Problem	Language	Result	Execution time	Memory
873892		noiaint	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	100 / 100	708 ms	96572 KiB

sortbooks

#include <bits/stdc++.h>

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int n, q;
int a[N];
vector<tuple<int, int, int> > query[N];
int lpos[N];
int res[N];

int bit[N];

void update(int u, int c) {
	for (; u > 0; u -= u &(-u)) maxi(bit[u], c);
}
int get(int u) {
	int res = 0;
	for (; u <= n; u += u & (-u)) maxi(res, bit[u]);
	return res;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    cin >> n >> q;
    for (int i = 1; i <= n; ++i)
    	cin >> a[i];
    for (int i = 1; i <= q; ++i) {
    	int l, r, c;
    	cin >> l >> r >> c;
    	query[r].emplace_back(l, c, i);
    }

    stack<int> st;
    for (int i = 1; i <= n; ++i) {
    	while (st.size() && a[i] >= a[st.top()]) st.pop();
    	lpos[i] = st.size() ? st.top() : 0;
    	st.push(i);
    }

    for (int i = 1; i <= n; ++i) {
    	if (lpos[i]) {
    		update(lpos[i], a[lpos[i]] + a[i]);
    	}
    	for (auto [l, c, id] : query[i]) {
    		res[id] = get(l) <= c;
    	}
    }

    for (int i = 1; i <= q; ++i) {
    	cout << res[i] << ' ';
    }

    return 0;
}

/*

*/

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