| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 876634 | Irate | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++14 | 3057 ms | 14468 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 main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, q;
cin >> n >> q;
vector<int>v(n);
for(int i = 0;i < n;++i)cin >> v[i];
while(q--){
int l, r, k;
cin >> l >> r >> k;
l--;
r--;
int mx = v[l], res = 0;
for(int i = l + 1;i <= r;++i){
if(mx > v[i]){
res = max(res, mx + v[i]);
}
mx = max(mx, v[i]);
}
cout << (res <= k) << '\n';
}
}| # | 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... | ||||
