제출 #1123099

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1123099		gdragon	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	0 / 100	292 ms	86332 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 + 1, 0);
    }
    void init() {
        fill(ALL(v), 0);
    }
    void update(int x, int c) {
        for(; x <= n; x += x & -x) v[x] = max(v[x], c);
    }
    int getMax(int x) {
        int ans = 0;
        for(; x > 0; x -= x & -x) ans = max(ans, v[x]);
        return ans;
    }
} fw;
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]);
            if (tmp != 0) ans = max(ans, a[i] + tmp);
            fw.update(pos[i], a[i]);
        }
        cout << (ans <= k ? 1 : 0) << endl;
    }
}
void solve() {
    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();
}
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:85:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |         freopen(TASK".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:86:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |         freopen(TASK".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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