Submission #1124307

#	Time	Username	Problem	Language	Result	Execution time	Memory
1124307		zhasyn	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	17 / 100	3095 ms	8260 KiB

sortbooks

#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
#define F first
#define S second
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 1e6 + 100, M = 500 + 10, len = 315, inf = 1e18;
const ll mod = 998244353;
ll um(ll a, ll b){
	return (1LL * a * b) % mod;
}
ll subr(ll a, ll b){
	return ((1LL * a - b) % mod + mod) % mod;
}
ll bp(ll x, ll step){
	ll res = 1;
	while(step){
		if(step & 1) res = um(res, x);
		x = um(x, x);
		step /= 2;
	}
	return res;
}
ll inv(ll x){
	return bp(x, mod - 2);
}
ll arr[N];
int main() {
	int n, d;
	cin >> n >> d;
	for(int i = 1; i <= n; i++){
		cin >> arr[i];
	}
	for(int i = 0, l, r, k; i < d; i++){
		cin >> l >> r >> k;
		bool can = true;
		ll mx = arr[l];
		for(int j = l +1; j <= r; j++){
			if(mx > arr[j]){
				if(mx + arr[j] > k) can = false;
			} else mx = arr[j];
		}
		cout << can << endl;
	}
  return 0;
}

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