Submission #237543

#	Time	Username	Problem	Language	Result	Execution time	Memory
237543		kostia244	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	1089 ms	68216 KiB

sortbooks

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1<<20;
int n, m, a[maxn], f[maxn], ans[maxn];
vector<array<int, 3>> q[maxn];
void upd(int i, int x) {
	for(;i; i -= i&-i) f[i] = max(f[i], x); 
}
int get(int i) {
	int r = 0;
	for(;i <= n; i += i&-i) r = max(f[i], r);
	return r; 
}
int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin >> n >> m;
	a[0] = 1<<30;
	for(int i = 1; i <= n; i++) cin >> a[i];
	for(int l, r, k, i = 0; i < n; i++) {
		cin >> l >> r >> k;
		q[r].push_back({l, k, i});
	}
	vector<int> t {0};
	for(int i = 1; i <= n; i++) {
		while(!t.empty() && a[t.back()] < a[i]) t.pop_back();
		if(!t.empty()) {
			upd(t.back(), a[t.back()] + a[i]);
		}
		t.push_back(i);
		for(auto [l, k, p] : q[i]) ans[p] = get(l) <= k;
	}
	for(int i = 0; i < m; i++) cout << ans[i] << '\n';
}

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