Submission #465561

#	Time	Username	Problem	Language	Result	Execution time	Memory
465561		NhatMinh0208	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	100 / 100	1618 ms	104376 KiB

sortbooks

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif

int sta[200001];

// A list of preset merge functions.
int cmpg(int a, int b){if (a>b) return a; else return b;}
//The segement tree itself.
struct seg2
{
    int val[4000001];
    int def=0;
    int (*merg)(int,int); // Merge function. It must be associative.
    void reset(int c, int l, int r)
    {
        if (l<r)
        {
            int mid=(l+r)/2;
            reset((c<<1),l,mid);
            reset((c<<1)+1,mid+1,r);
            val[c]=def;
        }
        else val[c]=def;
    }
    void upd(int c, int l, int r, int x, int tl, int tr)
    {


        if ((tl>r)or(tr<l)) return ;
        if ((tl<=l)and(tr>=r)) val[c]=max(val[c],x);
        else 
        {
            int mid=(l+r)/2;
            upd((c<<1),l,mid,x,tl,tr);
            upd((c<<1)+1,mid+1,r,x,tl,tr);
        }



    }
    int get(int c, int l, int r, int t)
    {
        if ((l<=t)and(t<=r))
        {
            if (l==r) return val[c];
            else
            {
                int mid=(l+r)/2;
                int a=get((c<<1),l,mid,t);
                int b=get((c<<1)+1,mid+1,r,t);
                return max(val[c],max(a,b));
            }
        }
        else return def;
    }
};

seg2 st;

vector<int> vec,buc[1000001];
int n,m,i,j,k,t,t1,u,v,a,b;
int arr[1000001];
int ql[1000001];
int qr[1000001];
int qk[1000001];
int qx[1000001];
int main()
{
	fio;
    cin>>n;
    cin>>m;
    for (i=1;i<=n;i++)
    {
        cin>>arr[i];
    }
    st.reset(1,1,n);
    for (i=1;i<=m;i++)
    {
        cin>>ql[i]>>qr[i]>>qk[i];
        buc[qr[i]].push_back(i);
    }
    for (i=1;i<=n;i++)
    {
        while ((vec.size())and(arr[vec.back()]<=arr[i]))
        {
            vec.pop_back();
        }
        // for (auto g : vec) cout<<g<<' ';
        // cout<<endl;
        if (vec.size())
        {
            // cout<<vec.back()<<' '<<i<<endl;
            st.upd(1,1,n,arr[vec.back()]+arr[i],1,vec.back());
        }
        vec.push_back(i);
        for (auto g : buc[i])
        {
            u=st.get(1,1,n,ql[g]);
            // cout<<u<<endl;
            if (u<=qk[g]) qx[g]=1;
        }
    }
    for (i=1;i<=m;i++)
    {
        cout<<qx[i]<<endl;
    }
}
// Normie28;

Compilation message (stderr)

sortbooks.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

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