제출 #417672

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
417672		MarcoMeijer	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	100 / 100	2833 ms	104276 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 1e6+10;
const int N = (1<<20);

int n, m;
int w[MX];
int l[MX], r[MX], k[MX];

// fenwick tree
int ft[MX];
void addFT(int x, int v) {
    for(x++; x>0; x-=x&-x)
        ft[x] = max(ft[x], v);
}
int getFT(int x) {
    int res = 0;
    for(x++; x<MX; x+=x&-x)
        res = max(res,ft[x]);
    return res;
}

// queries
int a[MX];
vi qend[MX];
int ans[MX];

void program() {
    IN(n,m);
    RE1(i,n) IN(w[i]);
    RE(i,m) IN(l[i],r[i],k[i]);

    RE(i,m) qend  [r[i]].pb(i);

    vi stck;
    RE1(i,n) {
        int lowest = stck.empty() ? -1 : a[stck.back()];
        int ed = i;
        while(!stck.empty() && a[stck.back()] <= w[i]) {
            int u = stck.back(); stck.pop_back();
            if(a[u] != lowest && lowest != -1)
                addFT(ed-1,a[u] + lowest);
            ed = u;
            lowest = max(lowest, a[u]);
        }
        stck.pb(ed);
        a[ed] = w[i];
        FOR(j,qend[i]) {
            int res = getFT(l[j]);
            auto it = upper_bound(all(stck),l[j]);
            it--;
            auto it2 = it;
            it2++;
            if(it2 != stck.end())
                res = max(res, a[*it] + a[*it2]);
            ans[j] = res <= k[j];
        }
    }

    RE(i,m) cout<<ans[i]<<endl;
}

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