Submission #498598

#	Time	Username	Problem	Language	Result	Execution time	Memory
498598		Ziyoda	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	701 ms	22100 KiB

sortbooks

#include <bits/stdc++.h>

using namespace std;

int main()
{
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	int n, m;
	cin >> n >> m;
	long long a[n+1], b, mx=0, li, ri, ki;
	for(int i=1; i<=n; i++)
		cin >> a[i];
	for(int i=1; i<=m; i++){
		bool y=0;
		b = 0;
		cin >> li >> ri >> ki;
		for(int e=li; e<=ri; e++){
			if(b<a[e]){
				if(b+mx>ki)
					break;
				mx = 0;
				if(e!=ri && a[e]>a[e+1]){
					y=1; b=a[e];
					if(b>ki)
						break;	}
			}
			if(y && a[e]<b)
				mx = max(a[e], mx);
		}
		cout << b << ' ' << mx << "\n";
		if(b+mx>ki)
			cout << 0 << "\n";
		else
			cout << 1 << "\n";
		mx = 0;
	}
}

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