# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
952766 | idiotcomputer | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++11 | 3054 ms | 39144 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;
const int mxN = 1e6;
int n;
int vals[mxN];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int m;
cin >> n >> m;
for (int i =0; i < n; i++) cin >> vals[i];
int l,r,k,cmax;
bool work;
for (int i = 0; i < m; i++){
cin >> l >> r >> k;
l -= 1;
r -= 1;
bool work = true;
cmax = 0;
for (int j = l; j <= r; j++){
if (cmax > vals[j] && cmax+vals[j] > k){
work = false;
break;
}
cmax = max(cmax,vals[j]);
}
cout << work << '\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... |