| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 905813 | Der_Vlapos | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++17 | 3019 ms | 39436 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;
#define int long long
long double rnd(){return (long double)(rand()/RAND_MAX);}
main(){
srand(time(NULL));
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
int q;
cin>>q;
int a[n+1];
for(int i=1;i<=n;i++){
cin>>a[i];
}
int l[q+1],r[q+1],x[q+1];
for(int i=1;i<=q;i++){
cin>>l[i]>>r[i]>>x[i];
int b[n+1];
for(int j=1;j<=n;j++){
b[j]=a[j];
}
sort(b+l[i],b+r[i]+1);
int mx=-INT_MAX;
for(int j=l[i];j<=r[i];j++){
if(b[j]!=a[j]){
mx=b[j];
}
}
bool ans=1;
cout<<(b[l[i]]+mx<=x[i])<<endl;
}
}
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... | ||||
