제출 #681760

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
681760		SnoT	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	17 / 100	3080 ms	8140 KiB

sortbooks

#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)
/*void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}*/
ll a,b,c,e,d,f,k,g,h,q[2000000],i,j,x,y,z,m,n,l,r,w,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;
		t=0; x=q[l];
    for(j=l+1;j<=r;j++){
        if(x>q[j]) t=max(t,x+q[j]);
        x=max(x,q[j]);
    }

    if(k>=t) cout<<1<<endl;
    else cout<<0<<endl;
	}
	
}

• Subtask 1: 8 / 8
• Subtask 2: 9 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23