Submission #683564

#	Time	Username	Problem	Language	Result	Execution time	Memory
683564		FatihSolak	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	17 / 100	3064 ms	3248 KiB

sortbooks

#include <bits/stdc++.h>
#define N 200005
using namespace std;
int a[N];
void solve(){
	int n,m;
	cin >> n >> m;
	for(int i = 1;i<=n;i++){
		cin >> a[i];
	}
	for(int i =1;i<=m;i++){
		int l,r,k;
		cin >> l >> r >> k;
		int maxi = 0;
		for(int  j = l;j<=r;j++){
			for(int c = j+1;c<=r;c++){
				if(a[c] >= a[j])break;
				maxi = max(maxi,a[j] + a[c]);
			}
		}
		cout << (maxi <= k) << '\n';
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	#ifdef Local
	freopen("in.txt","r",stdin);
	freopen("out.txt","w",stdout);
	#endif
	int t=1;
	//cin>>t;
	while(t--){
		solve();
	}
	#ifdef Local
	cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
	#endif
}

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