이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define ull unsigned long long
#define ssort sort(s.begin(),s.end());
#define sreverse reverse(s.begin(),s.end());
#define sclear s.clear();
#define ssize s.size();
#define ld long double
#define F first
#define S second
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define sq(a) (a)*(a)
ll a,b,c,e,d,f,k,g,h,q[3000000],qr[3000000],r,i,j,x,y,z,m,n,l,t,p,s,u,sum,ans,mod=1e18;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin>>n>>m;
for(i=1;i<=n;i++)
{
cin>>q[i];
}
for(i=1;i<=m;i++)
{
cin>>l>>r>>k;
for(j=l;j<=r;j++)
{
qr[j]=q[j];
}
sort(q+l+1,q+r+1);
if(q[r]+q[r-1]>k) cout<<0<<endl;
else cout<<1<<endl;
}
}
# | 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... |