# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
598949 | Plurm | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++11 | 3095 ms | 20668 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int w[1000005];
int main() {
int n, m;
scanf("%d%d", &n, &m);
stack<int> stk;
vector<pair<int, int>> interesting;
for (int i = 1; i <= n; i++) {
scanf("%d", w + i);
while (!stk.empty() && w[stk.top()] <= w[i])
stk.pop();
if (!stk.empty())
interesting.push_back({stk.top(), i});
stk.push(i);
}
while (!stk.empty())
stk.pop();
for (int i = n; i > 0; i--) {
while (!stk.empty() && w[stk.top()] >= w[i])
stk.pop();
if (!stk.empty())
interesting.push_back({i, stk.top()});
stk.push(i);
}
for (int i = 0; i < m; i++) {
int l, r, k;
scanf("%d%d%d", &l, &r, &k);
bool counter = false;
for (auto p : interesting) {
if (w[p.first] + w[p.second] > k && l <= p.first && p.second <= r) {
counter = true;
break;
}
}
if (counter)
printf("0\n");
else
printf("1\n");
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |