Submission #875739

#	Time	Username	Problem	Language	Result	Execution time	Memory
875739		8pete8	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	100 / 100	655 ms	65460 KiB

sortbooks

#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset>
#include <iomanip>  
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
#define ll long long    
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<pii,int>
#define vi vector<int>
#define pb push_back
//#define p push
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
#pragma GCC optimize ("03,unroll-lopps")
const int mxn=1e6+10,inf=1e9;
int n,m;
struct seg{
    int v[2*mxn+10];
    void update(int pos,int val){
        pos+=n;
        v[pos]=max(v[pos],val);
        for(;pos>0;pos>>=1)v[pos>>1]=max(v[pos],v[pos^1]);
    }
    int qry(int l,int r){
        int ans=0;
        for(l+=n,r+=n;l<=r;l>>=1,r>>=1){
            if(l&1)ans=max(ans,v[l++]);
            if(!(r&1))ans=max(ans,v[r--]);
        }
        return ans;
    }
}t;
int32_t main(){
    fastio
    cin>>n>>m;
    vector<int>v(n);
    for(int i=0;i<n;i++)cin>>v[i];
    vector<ppii>g;
    vector<pair<pii,pii>>q(m);
    for(int i=0;i<m;i++)cin>>q[i].f.f>>q[i].f.s>>q[i].s.f,q[i].s.s=i,q[i].f.f--,q[i].f.s--;
    stack<int>st;
    for(int i=0;i<n;i++){
        while(!st.empty()&&v[st.top()]<=v[i])st.pop();
        if(!st.empty())g.pb({{st.top(),i},v[i]+v[st.top()]});
        st.push(i);
    }
    sort(rall(g));
    sort(rall(q));
    vector<int>ans(m,0);
    int cur=0;
    for(int i=0;i<m;i++){
        while(cur<g.size()&&g[cur].f.f>=q[i].f.f)t.update(g[cur].f.s,g[cur].s),cur++;
        ans[q[i].s.s]=(t.qry(0,q[i].f.s)<=q[i].s.f);
    }
    for(auto i:ans)cout<<i<<'\n';
}

Compilation message (stderr)

sortbooks.cpp:35:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   35 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
sortbooks.cpp:40:32: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   40 |     void update(int pos,int val){
      |                                ^
sortbooks.cpp:45:24: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   45 |     int qry(int l,int r){
      |                        ^
sortbooks.cpp:54:14: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   54 | int32_t main(){
      |              ^
sortbooks.cpp: In function 'int32_t main()':
sortbooks.cpp:73:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |         while(cur<g.size()&&g[cur].f.f>=q[i].f.f)t.update(g[cur].f.s,g[cur].s),cur++;
      |               ~~~^~~~~~~~~

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