이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int a[n];
for(int i=1 ;i<=n ;i++){
cin>>a[i];
}
while(m--){
int l,r,k;
cin>>l>>r>>k;
int qwemsafovorlpwqpkwqekxzcmnldsfjoewirmfkdintaaacinaaaforaaaaaaaaaaaaaaa=0;
for(int i=l ;i<=r ;i++){
for(int j=i+1 ;j<=r; j++){
if (a[i]+a[j]>k && a[i]>a[j]){
cout<<"0\n";
//cout<<a[i]<<" "<<a[j]<<" "<<i<<" "<<j<<" "<<k<<" \n";
qwemsafovorlpwqpkwqekxzcmnldsfjoewirmfkdintaaacinaaaforaaaaaaaaaaaaaaa=1;
i=r+1;
j=r+1;
}
}
}
if(qwemsafovorlpwqpkwqekxzcmnldsfjoewirmfkdintaaacinaaaforaaaaaaaaaaaaaaa==0){
cout<<"1\n";
}
}
}
# | 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... |