#include <bits/stdc++.h>
using namespace std;
#define inf 0x3F3F3F3F3F3F3F3F
#define int long long
const int MXN = 1e6 + 5;
int n, q;
int a[MXN];
vector<int> st[MXN << 2];
int mx[MXN << 2];
void build(int l, int r, int x)
{
mx[x] = 0;
if (l == r)
{
st[x].push_back(a[l]);
return;
}
int mid = (l + r) >> 1;
build(l, mid, 2*x), build(mid + 1, r, 2*x + 1);
st[x].resize(st[2*x].size() + st[2*x + 1].size());
while (st[2*x].empty() || st[2*x + 1].empty()) 1;
int i = 0, j = 0;
while (i < st[2*x].size() && j < st[2*x + 1].size())
{
if (st[2*x][i] < st[2*x + 1][j]) st[x].push_back(st[2*x][i++]);
else st[x].push_back(st[2*x + 1][j++]);
}
while (i < st[2*x].size()) st[x].push_back(st[2*x][i++]);
while (j < st[2*x + 1].size()) st[x].push_back(st[2*x + 1][j++]);
if (st[2*x].back() > st[2*x + 1][0]) mx[x] = st[2*x].back() + *--lower_bound(st[2*x + 1].begin(), st[2*x + 1].end(), st[2*x].back());
mx[x] = max({mx[x], mx[2*x], mx[2*x + 1]});
}
vector<int> res;
int get(int l, int r, int x, int lx, int rx)
{
if (l > rx || r < lx) return -inf;
if (l >= lx && r <= rx)
{
res.push_back(x);
return mx[x];
}
int mid = (l + r) >> 1;
return max(get(l, mid, 2*x, lx, rx), get(mid + 1, r, 2*x + 1, lx, rx));
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> q;
for (int i = 1; i <= n; i++) cin >> a[i];
build(1, n, 1);
while (q--)
{
res.clear();
int l, r, x;
cin >> l >> r >> x;
int ans = get(1, n, 1, l, r), curmx = -inf;
// for (int i = 0; i + 1 < res.size(); i++)
// {
// int l = res[i], r = res[i + 1];
// curmx = max(curmx, st[l].back());
// if (curmx > st[r][0]) ans = max(ans, curmx + *--lower_bound(st[r].begin(), st[r].end(), curmx));
// }
cout << (ans <= x) << '\n';
}
}
Compilation message
sortbooks.cpp: In function 'void build(long long int, long long int, long long int)':
sortbooks.cpp:26:49: warning: statement has no effect [-Wunused-value]
26 | while (st[2*x].empty() || st[2*x + 1].empty()) 1;
| ^
sortbooks.cpp:28:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
28 | while (i < st[2*x].size() && j < st[2*x + 1].size())
| ~~^~~~~~~~~~~~~~~~
sortbooks.cpp:28:33: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
28 | while (i < st[2*x].size() && j < st[2*x + 1].size())
| ~~^~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:33:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
33 | while (i < st[2*x].size()) st[x].push_back(st[2*x][i++]);
| ~~^~~~~~~~~~~~~~~~
sortbooks.cpp:34:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
34 | while (j < st[2*x + 1].size()) st[x].push_back(st[2*x + 1][j++]);
| ~~^~~~~~~~~~~~~~~~~~~~
sortbooks.cpp: In function 'int main()':
sortbooks.cpp:64:33: warning: unused variable 'curmx' [-Wunused-variable]
64 | int ans = get(1, n, 1, l, r), curmx = -inf;
| ^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
44 ms |
94300 KB |
Output is correct |
| 2 |
Correct |
44 ms |
94152 KB |
Output is correct |
| 3 |
Incorrect |
44 ms |
94592 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
44 ms |
94300 KB |
Output is correct |
| 2 |
Correct |
44 ms |
94152 KB |
Output is correct |
| 3 |
Incorrect |
44 ms |
94592 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
214 ms |
262144 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
130 ms |
262144 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
44 ms |
94300 KB |
Output is correct |
| 2 |
Correct |
44 ms |
94152 KB |
Output is correct |
| 3 |
Incorrect |
44 ms |
94592 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
44 ms |
94300 KB |
Output is correct |
| 2 |
Correct |
44 ms |
94152 KB |
Output is correct |
| 3 |
Incorrect |
44 ms |
94592 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
