# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
412794 | MasterTaster | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++14 | 2 ms | 716 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 pb push_back
#define ll long long
#define pii pair<int, int>
#define xx first
#define yy second
#define MAXN 5010
using namespace std;
int n, m, a[MAXN];
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>>n>>m;
for (int i=0; i<n; i++) cin>>a[i];
while (m--)
{
int l, r, k; cin>>l>>r>>k;
l--; r--;
vector<int> koji;
for (int i=l; i<=r; i++) koji.pb(a[i]);
sort(koji.begin(), koji.end());
int minn=koji[0]; int maxx;
for (int i=koji.size()-1; i>=0; i--)
{
if (koji[i]!=a[i+l]) { maxx=koji[i]; break; }
}
//cout<<minn<<" "<<maxx<<endl;
cout<<(((maxx+minn)<=k) ? 1 : 0)<<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... |