# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
681462 | tegshzaya | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++14 | 0 ms | 0 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 ll long long
using namespace std;
int a,b,c[1000010],d,e,f,g,h,i,j,k,l;
map<ll> m;
main(){ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>a>>b;
for (i=1; i<=a; i++)
{cin>>h;
if (m[h]==0) m[h]++,c[++l]=h;
}
for (i=1; i<=b; i++)
{cin>>d>>e>>f;
for (j=d; j<=e; j++)
{
for (k=j+1; k<=e; k++)
if (c[j]>c[k]){if (c[j]+c[k]>f) {cout<<"0"<<" ";g=100; break;}}
if (g==100) break;
}
if (g!=100){cout<<'1'<<" "; continue;}
g=0;
}
}