제출 #341699

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
341699		blacktulip	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	77 / 100	2526 ms	52840 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 int long long
#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 lo inf = 3000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 1000005;
const lo mod = 1000000007;

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

inline void build(int node,int start,int end){
	if(start==end){tree[node]=dp[start];return ;}
	build(node*2,start,mid),build(node*2+1,mid+1,end);
	tree[node]=max(tree[node*2],tree[node*2+1]);
}

inline int query(int node,int start,int end,int l,int r){
	if(start>end || start>r || end<l)return 0;
	if(start>=l && end<=r)return tree[node];
	return max(query(node*2,start,mid,l,r),query(node*2+1,mid+1,end,l,r));
}

int32_t main(void){
    scanf("%lld %lld",&n,&t);
	if(n<=200000){
		FOR scanf("%lld",&a[i]);
		int sqrtt=sqrt(n);
		int mx=0;
		//~ int mn=inf;
		for(int i=0;i<=n;i++)mini[i]=inf;
		int maxx=0;
		FOR{
			if(a[i]<maxi[i/sqrtt])dp[i/sqrtt]=max(dp[i/sqrtt],maxi[i/sqrtt]+a[i]);
			maxi[i/sqrtt]=max(maxi[i/sqrtt],a[i]);
			mini[i/sqrtt]=min(mini[i/sqrtt],a[i]);
			v[i/sqrtt].pb(a[i]);
			maxx=max(maxx,i/sqrtt);
		}
		for(int i=0;i<=maxx;i++) sort(v[i].begin(),v[i].end());
		while(t--){
			int l,r,x;
			scanf("%lld %lld %lld",&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 j=l;j<=r;j++){
						mx=max(mx,a[j]);
						if(a[j]<mx)cev=max(cev,mx+a[j]);
					}
					continue;
				}
				if(bas<l){
					for(int j=l;j<=son;j++){
						mx=max(mx,a[j]);
						if(a[j]<mx)cev=max(cev,mx+a[j]);
					}
					continue;
				}
				if(son>r){
					for(int j=bas;j<=r;j++){
						mx=max(mx,a[j]);
						if(a[j]<mx)cev=max(cev,mx+a[j]);
					}
					continue;
				}
				//~ cout<<i<<" :: "<<dp[i]<<" :: "<<mini[i]<<" :: "<<maxi[i]<<endl;
				cev=max(cev,dp[i]);
				int at=lower_bound(v[i].begin(),v[i].end(),mx)-v[i].begin();
				if(at!=0){
					at--;
					cev=max(cev,mx+v[i][at]);
				}
				//~ 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;
	}
	for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
	stack<pair<int,int>> st;
	for(int i=1;i<=n;i++){
		while(st.size() && st.top().fi<=a[i]){
			st.pop();
		}
		if(st.size()==0)dp[i]=0;
		else dp[i]=st.top().se;
		st.push({a[i],i});
	}
	build(1,1,n);
	while(t--){
		int l,r,x;
		scanf("%lld %lld %lld",&l,&r,&x);
		int at=query(1,1,n,l,r);
		if(at>=l){printf("0\n");}
		else printf("1\n");
	}
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

sortbooks.cpp: In function 'int32_t main()':
sortbooks.cpp:46:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   46 |     scanf("%lld %lld",&n,&t);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
sortbooks.cpp:48:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   48 |   FOR scanf("%lld",&a[i]);
      |       ~~~~~^~~~~~~~~~~~~~
sortbooks.cpp:64:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   64 |    scanf("%lld %lld %lld",&l,&r,&x);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:111:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  111 |  for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
      |                       ~~~~~^~~~~~~~~~~~~~
sortbooks.cpp:124:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  124 |   scanf("%lld %lld %lld",&l,&r,&x);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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