Submission #341667

#	Time	Username	Problem	Language	Result	Execution time	Memory
341667		blacktulip	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	3073 ms	10220 KiB

sortbooks

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=0;i<n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const int inf = 3000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t,maxi[li],mx,dp[li],mini[li];
int cev;
string s;
vector<int> v;

int main(void){
    scanf("%d %d",&n,&t);
	FOR scanf("%d",&a[i]);
	int sqrtt=sqrt(n);
	int mx=0;
	int mn=inf;
	for(int i=0;i<=n;i++)mini[i]=inf;
	FOR{
		if(i!=0 && i/sqrtt!=(i-1)/sqrtt){
			mx=0;
			mn=inf;
		}
		mx=max(mx,a[i]);
		mn=min(mn,a[i]);
		if(a[i]<mx)dp[i/sqrtt]=max(dp[i/sqrtt],mx+a[i]);
		maxi[i/sqrtt]=max(maxi[i/sqrtt],a[i]);
		mini[i/sqrtt]=min(mini[i/sqrtt],a[i]);
	}
	while(t--){
		int l,r,x;
		scanf("%d %d %d",&l,&r,&x);
		mx=0;
		cev=0;
		l--;
		r--;
		for(int i=0;i<=n;i++){
			int bas=i*sqrtt;
			int son=(i+1)*sqrtt-1;
			if(son<l)continue;
			if(bas>r)break;
			if(bas<=l && son>=r){
				for(int i=l;i<=r;i++){
					mx=max(mx,a[i]);
					if(a[i]<mx)cev=max(cev,mx+a[i]);
				}
				continue;
			}
			if(bas<=l){
				for(int i=l;i<=son;i++){
					mx=max(mx,a[i]);
					if(a[i]<mx)cev=max(cev,mx+a[i]);
				}
				continue;
			}
			if(son>=r){
				for(int i=bas;i<=r;i++){
					mx=max(mx,a[i]);
					if(a[i]<mx)cev=max(cev,mx+a[i]);
				}
				continue;
			}
			cev=max(cev,dp[i]);
			if(mini[i]<mx)cev=max(cev,mini[i]+mx);
			mx=max(mx,maxi[i]);
		}
		if(cev>x)printf("0\n");
		else printf("1\n");
	}
    return 0;
}

Compilation message (stderr)

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:33:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |     scanf("%d %d",&n,&t);
      |     ~~~~~^~~~~~~~~~~~~~~
sortbooks.cpp:34:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   34 |  FOR scanf("%d",&a[i]);
      |      ~~~~~^~~~~~~~~~~~
sortbooks.cpp:52:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   52 |   scanf("%d %d %d",&l,&r,&x);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~

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