| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1336035 | yhkhoo | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++17 | 3094 ms | 4360 KiB |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n, q;
cin >> n >> q;
int w[n];
for(int i=0; i<n; i++){
cin >> w[i];
}
for(int i=0; i<q; i++){
int l, r, m;
cin >> l >> r >> m;
l--; r--;
int ma = -1;
bool ans = 1;
for(int j=l; j<=r; j++){
if(w[j] < ma){
if(w[j] + ma > m){
ans = 0;
//break;
}
}
else{
ma = w[j];
}
}
cout << ans << '\n';
}
return 0;
}
| # | 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... | ||||
