Submission #1130911

#	Time	Username	Problem	Language	Result	Execution time	Memory
1130911		Tsagana	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	64 / 100	120 ms	17340 KiB

sortbooks

#include<bits/stdc++.h>

#define IOS ios_base::sync_with_stdio(false);cin.tie();cout.tie();
#define all(x) x.begin(), x.end()
#define int long long
#define pq priority_queue
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pp pop_back
#define F first
#define S second

using namespace std;

int n, m;
int a[200001];
int f[200001];
int ans[200001];
vector<array<int, 3>> q[200001];

void update(int i, int x) {
	for (; i; i -= i&-i) f[i] = max(x, f[i]);
}
int calc(int i) {
	int x = 0;
	for (; i <= n; i += i&-i) x = max(x, f[i]);
	return x;
}

void solve () {
	cin >> n >> m;
	a[0] = 1 << 30;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 0; i < m; i++) {
		int l, r, k;
		cin >> l >> r >> k;
		q[r].pb({l, k, i});
	}
	vector<int> t{0};
	for (int i = 1; i <= n; i++) {
		while (a[t.back()] <= a[i]) t.pp();
		if (t.back()) update(t.back(), a[t.back()] + a[i]);
		t.pb(i);
		for (auto [l, k, p]: q[i]) ans[p] = calc(l) <= k;
	}
	for (int i = 0; i < m; i++) cout << ans[i] << '\n';
}
signed main() {IOS solve(); return 0;}

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