Submission #1096195

#	Time	Username	Problem	Language	Result	Execution time	Memory
1096195		Muhammet	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	262 ms	262144 KiB

sortbooks

#include <bits/stdc++.h>

using namespace std;

#define sz(s) (int)s.size()
#define ff first
#define ss second
#define ll long long

const int N = 1e6+5;

ll n, m, l[N], r[N], a[N], id[N], an[N], mmx[N];

pair <ll,ll> rn[N];

int main(){
	ios::sync_with_stdio (false); cin.tie(nullptr);
	cin >> n >> m;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
	}
	ll nq = sqrt(n), cnt = 0;
	vector <vector <ll>> b(nq+10, vector <ll> (n+10,0));
	for(int i = 1; i <= n; i++){
		cnt++;
		ll mx = 0;
		for(int j = i; j <= min(i+nq-1,n); j++){
			if(mx > a[j]) an[cnt] = max(an[cnt],mx+a[j]);
			mx = max(mx,a[j]);
			id[j] = cnt;
		}
		mmx[cnt] = mx;
		rn[cnt] = {i,min(i+nq-1,n)};
		i = min(i+nq-1,n);
	}
	vector <ll> v;
	for(int i = 1; i <= n; i++){
		v.clear();
		for(int j = i; j <= min(i+nq-1,n); j++){
			v.push_back(a[j]);
		}
		sort(v.begin(), v.end());
		ll ind = 0;
		ll mx = 0;
		for(int j = i-1; j >= 1; j--){
			mx = max(mx,a[j]);
			while(ind < sz(v)-1 and v[ind+1] < mx) ind++;
			b[id[i]][j] = v[ind];
		}
		i = min(i+nq-1,n);
	}
	for(int i = 1; i <= m; i++){
		ll l, r, k;
		cin >> l >> r >> k;
		ll mx = 0, ans = 0;
		for(int j = l; j <= min(rn[id[l]].ss,r); j++){
			if(a[j] < mx) ans = max(ans,a[j]+mx);
			mx = max(mx,a[j]);
		}
		ll ind = id[l]+1;
		while(ind < id[r]){
			ans = max(ans,an[ind]);
			if(b[ind][l] < mx and b[ind][l] != 0) ans = max(ans,mx+b[ind][l]);
			mx = max(mx,mmx[ind]);
			ind++;
		}
		cout << (ans > k ? 0 : 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