Submission #867661

#TimeUsernameProblemLanguageResultExecution timeMemory
86766112345678Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
8 / 100
3062 ms14164 KiB
#include <bits/stdc++.h>

using namespace std;

const int nx=1e6+5;
int n, m, v[nx], l, r, k;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=n; i++) cin>>v[i];
    while (m--)
    {
        cin>>l>>r>>k;
        int mx=0;
        for (int i=l; i<=r; i++)
        {
            for (int j=i+1; j<=r; j++)
            {
                if (v[j]<v[i]) mx=max(mx, v[j]+v[i]);
            }
        }
        cout<<(mx<=k)<<'\n';
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...