# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168061 | spartan_enkh | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++14 | 3042 ms | 2052 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>
#define max_n 200005
using namespace std;
int main(){
int n,m,i,k,j,l,r;
int a[max_n];
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++){
cin >> a[i];
}
for(i=1;i<=m;i++){
int ans=1;
cin >> l >> r >> k;
for(j=1;j<=r;j++){
for(int l=j+1;l<=r;l++){
if(a[j]>a[l] && a[j]+a[l]>k){
ans=0;
break;
}
}
if(!ans) break;
}
cout << ans << endl;
}
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... |