oj.uz

Submission #1040318

# Submission time Handle Problem Language Result Execution time Memory
1040318 2024-08-01T00:58:56 Z Yang8on Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
0 / 100
 1711 ms 262144 KB 
#include <bits/stdc++.h>
#define Y8o "Hedgehog Daniyar and Algorithms"
#define maxn (int) 1e6 + 5
#define ll long long
#define pii pair<ll, ll>
#define gb(i, j) ((i >> j) & 1)
#define all(x) x.begin(), x.end()
#define _left id * 2, l, mid
#define _right id * 2 + 1, mid + 1, r

//#define f first
//#define s second

using namespace std;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll GetRandom(ll l, ll r) {
    return uniform_int_distribution<ll> (l, r) (rng);
}
void iof() {
    if(fopen(Y8o".inp", "r"))
    {
        freopen(Y8o".inp", "r", stdin);
//        freopen(Y8o".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(NULL), cout.tie(NULL);
}
void ctime() {
    cerr << "\n" << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}


int n, Q, a[maxn];
struct Node { int val, ma, mi; };

Node operator + (const Node& x, const Node& y) {
    Node res = {0, 0, 0};
    res.ma = max(x.ma, y.ma);
    res.mi = min(x.mi, y.mi);
    res.val = max({ 0, x.val, y.val, x.ma - y.mi });
    return res;
}

struct SEGMENTREE {
    vector<int> cur[4 * maxn];
    int st[4 * maxn];

    void build(int id = 1, int l = 1, int r = n) {
        if(l == r) {
            st[id] = 0, cur[id].clear();
            cur[id].push_back(a[l]);
            return ;
        }
        int mid = (l + r) >> 1;
        build(_left), build(_right);

        st[id] = max(st[id * 2], st[id * 2 + 1]);
        int mx = cur[id * 2].back();
        int pos = lower_bound(all(cur[id * 2 + 1]), mx) - cur[id * 2 + 1].begin();
        if(pos != 0) {
            pos --;
            st[id] = max(st[id], mx + cur[id * 2 + 1][pos]);
        }
        cur[id].clear();
        merge(all(cur[id * 2]), all(cur[id * 2 + 1]), back_inserter(cur[id]));
    }

    void get(int u, int v, vector<int>& res, int id = 1, int l = 1, int r = n) {
        if(v < l || r < u) return ;
        if(u <= l && r <= v) return res.push_back(id), void();
        int mid = (l + r) >> 1;
        get(u, v, res, _left), get(u, v, res, _right);
    }
} ST;

void solve()
{
    cin >> n >> Q;
    for(int i = 1; i <= n; i ++) cin >> a[i];

    ST.build();
    for(int i = 1; i <= Q; i ++) {
        int l, r, k, ans = 0; cin >> l >> r >> k;

        vector<int> res;
        ST.get(l, r, res);

        if(res.size()) {
            int pre = 0, mx = 0;
            for(int id : res) {
                ans = max(ans, ST.st[id]);
                if(pre) {
                    int pos = lower_bound(all(ST.cur[id]), mx) - ST.cur[id].begin();
                    if(pos != 0) {
                        pos -- ;
                        ans = max(ans, ST.cur[id][pos]);
                    }
                }
                pre = id;
            }
        }
        cout << (ans <= k) << '\n';
    }
}


int main()
{
    iof();

    int nTest = 1;
//    cin >> nTest;

    while(nTest --) {
        solve();
    }

    ctime();
    return 0;
}

Compilation message

sortbooks.cpp: In function 'void iof()':
sortbooks.cpp:23:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         freopen(Y8o".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 94296 KB Output is correct
2 Correct 34 ms 94300 KB Output is correct
3 Incorrect 35 ms 94296 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 94296 KB Output is correct
2 Correct 34 ms 94300 KB Output is correct
3 Incorrect 35 ms 94296 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1711 ms 262144 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 139 ms 111120 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 94296 KB Output is correct
2 Correct 34 ms 94300 KB Output is correct
3 Incorrect 35 ms 94296 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 94296 KB Output is correct
2 Correct 34 ms 94300 KB Output is correct
3 Incorrect 35 ms 94296 KB Output isn't correct
4 Halted 0 ms 0 KB -