Submission #161587

#	Time	Username	Problem	Language	Result	Execution time	Memory
161587		MvC	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++11	77 / 100	3048 ms	31768 KiB

sortbooks

#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int bk=1500;
const int nmax=1e6+5000;
const int mod=1e9+7;
using namespace std;
int n,m,a[nmax],mx,i,j,l,r,k,mxx,bukmx[nmax/bk],bukmn[nmax/bk],buk[nmax/bk],x,f[nmax],mnn;
vector<int>vc[nmax/bk];
void calc(int l,int r)
{
	int mxx=0,mx=0,mn=inf;
	for(int i=l;i<=r;i++)
	{
		if(a[i]<mx)mxx=max(mxx,a[i]+mx);
		mx=max(mx,a[i]);
		mn=min(mn,a[i]);
		vc[l/bk].pb(a[i]);
	}
	buk[l/bk]=mxx;
	bukmx[l/bk]=mx;
	bukmn[l/bk]=mn;
	sort(vc[l/bk].begin(),vc[l/bk].end());
}
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>m;
	for(i=0;i<n;i++)cin>>a[i];
	mnn=inf;
	f[0]=1;
	for(i=1;i<n;i++)
	{
		if(a[i]>=a[i-1])f[i]=f[i-1]+1;
		else f[i]=1;
		mnn=min(mnn,a[i]);
	}
	for(i=0;i<n;i+=bk)
	{
		calc(i,min(i+bk-1,n-1));
	}
	while(m--)
	{
		cin>>l>>r>>k;
		l--,r--;
		if(k<mnn)
		{
			if(f[r]>=r-l+1)cout<<"1\n";
			else cout<<"0\n";
			continue;
		}
		mx=mxx=0;
		for(i=l;i<=r;i++)
		{
			if(i%bk==0)break;
			if(a[i]<mx)mxx=max(mxx,a[i]+mx);
			mx=max(mx,a[i]);
		}
		for(;i+bk<=r;i+=bk)
		{
			mxx=max(mxx,buk[i/bk]);
			if(bukmn[i/bk]<mx)
			{
				x=*(--upper_bound(vc[i/bk].begin(),vc[i/bk].end(),mx-1));
				mxx=max(mxx,mx+x);
			}
			mx=max(mx,bukmx[i/bk]);
		}
		for(;i<=r;i++)
		{
			if(a[i]<mx)mxx=max(mxx,a[i]+mx);
			mx=max(mx,a[i]);
		}
		if(mxx<=k)cout<<"1\n";
		else cout<<"0\n";
	}
	return 0;
}

Compilation message (stderr)

sortbooks.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
sortbooks.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")

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