제출 #1123153

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1123153		gdragon	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	64 / 100	3101 ms	227928 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
#define TASK "long"
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define GETBIT(mask, i) ((mask) >> (i) & 1)
#define MASK(i) ((1LL) << (i))
#define SZ(x) ((int)(x).size())
#define mp make_pair
#define CNTBIT(mask) __builtin_popcount(mask)
template<class X, class Y> bool maximize(X &x, Y y){ if (x < y) {x = y; return true;} return false;};
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y) {x = y; return true;} return false;};
typedef pair<int, int> ii;
const int N = 1e6 + 5;
const int inf = 1e9 + 7;
const long long INF = (long long)1e18 + 7;
const int mod = 1e9 + 7;
void add(int &x, int y) {x += y; if (x >= mod) x -= mod;}
void sub(int &x, int y) {x -= y; if (x < 0) x += mod;}
int mul(int x, int y) {return 1LL * x * y % mod;}
// -----------------------------------------//
struct Fenwick {
    int n;
    vector<int> v;
    Fenwick(int _n = 0) {
        n = _n;
        v.assign(n + 2, -1);
    }
    void init() {
        fill(ALL(v), -1);
    }
    void update(int x, int c) {
        for(; x <= n; x += x & -x) v[x] = max(v[x], c);
    }
    int getMax(int x) {
        int ans = -1;
        for(; x > 0; x -= x & -x) ans = max(ans, v[x]);
        return ans;
    }
} fw;
struct Segtree {
    int n;
    vector<int> mx, st, val, lz;
    Segtree(int _n = 0) {
        n = _n;
        st.assign(4 * n + 5, 0);
        val.assign(4 * n + 5, 0);
        mx.assign(4 * n + 5, -1);
        lz.assign(4 * n + 5, -1);
    }
    void build(int id, int l, int r, int a[]) {
        if (l == r) {
            val[id] = a[l];
            // st[id] = 0;
            return;
        }
        int mid = (l + r) >> 1;
        build(id<<1, l, mid, a);
        build(id<<1|1, mid + 1, r, a);
        val[id] = max(val[id<<1], val[id<<1|1]);
        mx[id] = max(mx[id<<1], mx[id<<1|1]);
        st[id] = (mx[id] >= 0 ? val[id] + mx[id] : 0);
    }
    void down(int id) {
        int &t = lz[id];
        if (t == -1) return;
        lz[id<<1] = lz[id<<1|1] = t;
        mx[id<<1] = mx[id<<1|1] = t;
        st[id<<1] = val[id<<1] + t;
        st[id<<1|1] = val[id<<1|1] + t;
        t = -1;
    }
    void update(int id, int l, int r, int u, int v, int x) {
        if (u > r || v < l) return;
        if (u <= l && r <= v) {
            if (mx[id] >= x) return;
            mx[id] = x;
            lz[id] = x;
            st[id] = val[id] + mx[id];
            return;
        }
        down(id);
        int mid = (l + r) >> 1;
        update(id<<1, l, mid, u, v, x);
        update(id<<1|1, mid + 1, r, u, v, x);
        mx[id] = max(mx[id<<1], mx[id<<1|1]);
        st[id] = max(st[id<<1], st[id<<1|1]);
    }
    void update(int l, int r, int x) {
        if (l > r) return;
        return update(1, 1, n, l, r, x);
    }
    int getMax(int id, int l, int r, int u, int v) {
        if (u > r || v < l) return 0;
        if (u <= l && r <= v) return st[id];
        down(id);
        int mid = (l + r) >> 1;
        return max(getMax(id<<1, l, mid, u, v), getMax(id<<1|1, mid + 1, r, u, v));
    }
    int getMax(int l, int r) {
        if (l > r) return 0;
        return getMax(1, 1, n, l, r);
    }
} it;
const int LOG = 20;
int n, q;
int a[N], f[N][LOG + 1];
int pos[N];
void read() {
    cin >> n >> q;
    for(int i = 1; i <= n; i++) cin >> a[i];
}
// int getMax(int l, int r) {
//     if (l > r) return 0;
//     int k = log2(r - l + 1);
//     return max(f[l][k], f[r - MASK(k) + 1][k]);
// }
void sub2() {
    vector<int> val;
    for(int i = 1; i <= n; i++) val.push_back(a[i]);
    sort(ALL(val)); val.erase(unique(ALL(val)), val.end());
    for(int i = 1; i <= n; i++) pos[i] = lower_bound(ALL(val), a[i]) - val.begin() + 1;
    fw = Fenwick(n);
    while(q--) {
        fw.init();
        int l, r, k; cin >> l >> r >> k;
        int ans = 0;
        for(int i = r; i >= l; i--) {
            int tmp = fw.getMax(pos[i] - 1);
            if (tmp >= 0) ans = max(ans, a[i] + tmp);
            fw.update(pos[i], a[i]);
        }
        cout << (ans <= k ? 1 : 0) << endl;
    }
}
void sub3() {
    vector<int> pref(n + 2, 0);
    for(int i = 2; i <= n; i++) {
        if (a[i] >= a[i - 1]) pref[i] = pref[i - 1] + 1;
        else pref[i] = 0;
    } 
    while(q--) {
        int l, r, k; cin >> l >> r >> k;
        if (pref[r] >= r - l) cout << 1;
        else cout << 0;
        cout << endl;
    }
}
vector<pair<int, int>> queries[N], queries1[N];
int numK[N], g[N], ans[N];
void lastsub() {
    for(int i = 1; i <= q; i++) {
        int l, r; cin >> l >> r >> numK[i];
        queries[r].push_back({l, i});
        queries1[l].push_back({r, i});
    }
    it = Segtree(n);
    it.build(1, 1, n, a);
    memset(g, 0, sizeof(g));
    deque<int> dq;
    for(int r = 1; r <= n; r++) {
        while(!dq.empty() && a[dq.back()] > a[r]) dq.pop_back();
        int j = (!dq.empty() ? dq.back() : 0);
        //for(int k = j + 1; k < r; k++) g[k] = max(g[k], a[r] + a[k]);
        it.update(j + 1, r - 1, a[r]);
        dq.push_back(r);
        for(auto [l, id]: queries[r]) {
            //for(int j = l; j <= r; j++) ans[id] = max(ans[id], g[j]);
            ans[id] = max(ans[id], it.getMax(l, r));
        }
    }
    while(dq.size()) dq.pop_front();
    memset(g, 0, sizeof(g));
    it = Segtree(n);
    it.build(1, 1, n, a);
    for(int l = n; l >= 1; l--) {
        while(!dq.empty() && a[dq.back()] < a[l]) dq.pop_back();
        int j = (!dq.empty() ? dq.back() : n + 1);
        // for(int k = l + 1; k < j; k++) g[k] = max(g[k], a[l] + a[k]);
        it.update(l + 1, j - 1, a[l]);
        dq.push_back(l);
        for(auto [r, id]: queries1[l]) {
            // for(int j = l; j <= r; j++) ans[id] = max(ans[id], g[j]);
            ans[id] = max(ans[id], it.getMax(l, r));
        }
    }
    for(int i = 1; i <= q; i++) {
        cout << (ans[i] <= numK[i] ? 1 : 0) << endl;
    }
}
void solve() {
    lastsub(); return;
    // for(int i = 1; i <= n; i++) f[i][0] = a[i];
    // for(int j = 1; j <= LOG; j++) {
    //     for(int i = 1; i + MASK(j) - 1 <= n; i++) f[i][j] = max(f[i][j - 1], f[i + MASK(j - 1)][j - 1]);
    // }
    if (max(n, q) <= 5000) {
        sub2();
        return;
    }
    sub3();
}
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }
    int test = 1;
    // cin >> test;
    while(test--) {
        read();
        solve();
    }
    return 0;
}

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

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:209:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  209 |         freopen(TASK".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:210:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  210 |         freopen(TASK".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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