Submission #1040400

#	Time	Username	Problem	Language	Result	Execution time	Memory
1040400		vjudge1	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	100 / 100	801 ms	97888 KiB

sortbooks

#include<bits/stdc++.h>
using namespace std ; 
#define maxn 1000009
#define ll long long 
#define pb push_back 
#define fi first 
#define se second 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1
const int mod = 1e9+7 ;
const int INF = 1e9 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 

template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; } 

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a >= mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ;
}

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

int n , q ; 
int a [maxn] ; 
int answer [maxn] ; 
struct shape {
	int pos,id,k ; 
};
vector<shape> event [maxn] ; 
int T [maxn*4] ; 
void update ( int id , int l , int r , int pos , int w ) 
{
	if ( l > pos || r < pos ) return ; 
	if ( l == r ) 
	{
		T [id] = w ; 
		return ; 
	}
	int mid = (l+r)/2 ; 
	update (left,l,mid,pos,w) ; update (right,mid+1,r,pos,w) ; 
	T [id] = max (T[left],T[right]) ; 
}
int get ( int id , int l , int r , int u , int v )
{
	if ( l > v || r < u ) return 0 ; 
	if ( u <= l && r <= v ) return T [id] ; 
	int mid = (l+r)/2 ; 
	return max (get(left,l,mid,u,v),get(right,mid+1,r,u,v)) ;
}
int main () 
{
	ios_base::sync_with_stdio(0); 
	cin.tie(0);cout.tie(0); 
//	rf () ; 	
	cin >> n >> q ; 
	for ( int i = 1 ; i <= n ; i ++ ) cin >> a [i] ;
	for ( int i = 1 ; i <= q ; i ++ ) 
	{
		int l , r , k ; cin >> l >> r >> k ; 
		event [r] . pb ({l,i,k}) ; 
	} 
	
	stack<int> S ; 
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		while ( !S.empty() && a[S.top()] <= a[i]) S.pop() ; 
		if (S.size()) update (1,1,n,S.top(),a[S.top()]+a[i]) ; 
		S.push(i) ; 
		for ( auto x : event [i] ) 
		{
			int pos = x.pos , id = x.id , k = x.k ; 
			if ( get (1,1,n,pos,i) <= k ) answer [id] = 1 ; 
			else answer [id] = 0 ; 
		}
	}
	for ( int i = 1 ; i <= q ; i ++ ) cout << answer [i] << "\n" ; 
}

Compilation message (stderr)

sortbooks.cpp: In function 'void rf()':
sortbooks.cpp:31:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

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