#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = 1e9 + 177013;
const int MAXN = 1e6 + 123;
int w[MAXN];
int pv[MAXN];
int get_max(int l, int r) {
int mx = -INF;
int ans = 0;
for (int i = l; i < r; ++i) {
if (mx > w[i])
ans = max(ans, mx + w[i]);
else
mx = w[i];
}
return ans;
}
void merg_add(vector<pair<int, int>>& a, pair<int, int> vl) {
while (a.size() && a.back() == vl) {
a.pop_back();
}
a.push_back(vl);
}
vector<pair<int, int>> merg(vector<pair<int, int>> a, vector<pair<int, int>> b) {
vector<pair<int, int>> ans;
int n = a.size();
int m = b.size();
int j = 0;
for (int i = 0; i < n; ++i) {
while (j < m && b[j] < a[i]) {
merg_add(ans, b[j]);
++j;
}
merg_add(ans, a[i]);
}
while (j < m) {
merg_add(ans, b[j]);
++j;
}
int s = ans.size();
for (int i = s - 2; i >= 0; --i) {
ans[i].second = max(ans[i].second, ans[i + 1].second);
}
return ans;
}
struct stree {
void resize(int n) {
sz = n;
t.resize(sz * 2 - 1);
go_down.resize(sz * 2 - 1);
init(0, 0, sz);
}
int get(int l, int r) {
return get(0, 0, sz, l, r, lower_bound(t[0].begin(), t[0].end(), pair<int, int>(l, -1)) - t[0].begin());
}
private:
int sz;
vector<vector<pair<int, int>>> t;
vector<vector<pair<int, int>>> go_down;
void init(int ind, int lnd, int rnd) {
if (rnd - lnd == 1) {
if (pv[lnd] >= 0)
t[ind] = {{pv[lnd], w[lnd] + w[pv[lnd]]}};
} else {
int mnd = (lnd + rnd) / 2;
int chd = ind + (mnd - lnd) * 2;
init(ind + 1, lnd, mnd);
init(chd, mnd, rnd);
t[ind] = merg(t[ind + 1], t[chd]);
int s = t[ind].size();
int n = t[ind + 1].size();
int m = t[chd].size();
go_down[ind].resize(s);
int upi = s - 1;
for (int i = n - 1; i >= 0; --i) {
while (upi >= 0 && (i == 0 || t[ind][upi].first > t[ind + 1][i - 1].first)) {
go_down[ind][upi].first = i;
--upi;
}
}
upi = s - 1;
for (int j = m - 1; j >= 0; --j) {
while (upi >= 0 && (j == 0 || t[ind][upi].first > t[chd][j - 1].first)) {
go_down[ind][upi].second = j;
--upi;
}
}
}
}
int get(int ind, int lnd, int rnd, int l, int r, int i) {
if (i == t[ind].size())
return 0;
int mnd = (lnd + rnd) / 2;
int chd = ind + (mnd - lnd) * 2;
if (lnd >= l && rnd <= r) {
return t[ind][i].second;
}
if (lnd >= r || rnd <= l)
return 0;
return max(get(ind + 1, lnd, mnd, l, r, go_down[ind][i].first), get(chd, mnd, rnd, l, r, go_down[ind][i].second));
}
};
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; ++i)
cin >> w[i];
vector<pair<int, int>> previnit = {{INF, -1}};
for (int i = 0; i < n; ++i) {
while (previnit.back().first <= w[i]) {
previnit.pop_back();
}
pv[i] = previnit.back().second;
previnit.push_back({w[i], i});
}
stree tr;
tr.resize(n);
for (int i = 0; i < m; ++i) {
int l, r, k;
cin >> l >> r >> k;
--l;
if (tr.get(l, r) > k) {
cout << 0 << '\n';
} else {
cout << 1 << '\n';
}
}
}
Compilation message
sortbooks.cpp: In member function 'int stree::get(int, int, int, int, int, int)':
sortbooks.cpp:102:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
102 | if (i == t[ind].size())
| ~~^~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
554 ms |
262144 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
404 ms |
34708 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
