Submission #1235996

#	Time	Username	Problem	Language	Result	Execution time	Memory
1235996		huyverstappen	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	0 / 100	225 ms	7620 KiB

sortbooks

#pragma GCC target ("popcnt,lzcnt,bmi,bmi2,abm")
#include <bits/stdc++.h>
using namespace std;
#define MaxVerstappen "tenbai"
//#define getbit(a,b) ((a>>b)&1) // lay ra bit thu b cua a
#define fir first
#define sec second
#define pii pair<int,int>
const int MOD = 1000000007;

int n, m, x, y, k;
int a[1000005];

int main ()
{

	ios_base::sync_with_stdio(0);
	cin.tie(NULL);

//	freopen(MaxVerstappen".inp", "r", stdin);
//	freopen(MaxVerstappen".out", "w", stdout);
	
	cin >> n >> m;
	for (int i = 1; i <= n; i++) cin >> a[i];
	
	while (m--)
	{
		cin >> x >> y;
		int ama = 0;
		for (int i = x; i <= y; i++)
		{
			if (i== x) 
			{
				ama = a[i];
				continue;
			}
			if (a[i] + ama > k && ama > a[i]) 
			{
				cout << 0 << '\n';
				break;
			}
			ama = max(ama, a[i]);
		}
		cout << 1 << '\n';
	}
	
}

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