oj.uz

Submission #747395

# Submission time Handle Problem Language Result Execution time Memory
747395 2023-05-24T06:51:44 Z GrindMachine Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
100 / 100
 976 ms 140380 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

template<typename T>
struct segtree {
    // https://codeforces.com/blog/entry/18051

    /*=======================================================*/

    struct data {
        ll a;
    };

    data neutral = {-inf2};

    data merge(data &left, data &right) {
        data curr;
        curr.a = max(left.a, right.a);
        return curr;
    }

    void create(int i, T v) {

    }

    void modify(int i, T v) {
        amax(tr[i].a, v);
    }

    /*=======================================================*/

    int n;
    vector<data> tr;

    segtree() {

    }

    segtree(int siz) {
        init(siz);
    }

    void init(int siz) {
        n = siz;
        tr.assign(2 * n, neutral);
    }

    void build(vector<T> &a, int siz) {
        rep(i, siz) create(i + n, a[i]);
        rev(i, n - 1, 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    void pupd(int i, T v) {
        modify(i + n, v);
        for (i = (i + n) >> 1; i; i >>= 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    data query(int l, int r) {
        data resl = neutral, resr = neutral;

        for (l += n, r += n; l <= r; l >>= 1, r >>= 1) {
            if (l & 1) resl = merge(resl, tr[l++]);
            if (!(r & 1)) resr = merge(tr[r--], resr);
        }

        return merge(resl, resr);
    }
};

void solve(int test_case)
{
    ll n,m; cin >> n >> m;
    vector<ll> a(n+5);
    rep1(i,n) cin >> a[i];

    stack<ll> st;
    vector<ll> nge(n+5,-1);

    rev(i,n,1){
        while(!st.empty() and a[i] > a[st.top()]){
            nge[st.top()] = i;
            st.pop();
        }
        st.push(i);
    }

    vector<array<ll,3>> queries[n+5];

    rep1(i,m){
        ll l,r,k; cin >> l >> r >> k;
        queries[r].pb({l,k,i});
    }

    segtree<ll> seg(n+5);
    vector<ll> ans(m+5);

    rep1(r,n){
        ll j = nge[r];
        if(j != -1){
            seg.pupd(j, a[r] + a[j]);            
        }

        for(auto [l,k,id] : queries[r]){
            ll mx = seg.query(l,r).a;
            if(mx > k) ans[id] = 0;
            else ans[id] = 1;
        }
    }

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

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 3 ms 704 KB Output is correct
14 Correct 4 ms 724 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 3 ms 724 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 932 ms 97440 KB Output is correct
2 Correct 954 ms 97360 KB Output is correct
3 Correct 946 ms 97500 KB Output is correct
4 Correct 939 ms 97360 KB Output is correct
5 Correct 955 ms 107860 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 9960 KB Output is correct
2 Correct 67 ms 10188 KB Output is correct
3 Correct 60 ms 11180 KB Output is correct
4 Correct 65 ms 12784 KB Output is correct
5 Correct 62 ms 12748 KB Output is correct
6 Correct 46 ms 12688 KB Output is correct
7 Correct 58 ms 12712 KB Output is correct
8 Correct 61 ms 11520 KB Output is correct
9 Correct 32 ms 5520 KB Output is correct
10 Correct 62 ms 11708 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 3 ms 704 KB Output is correct
14 Correct 4 ms 724 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 3 ms 724 KB Output is correct
19 Correct 155 ms 19684 KB Output is correct
20 Correct 166 ms 19644 KB Output is correct
21 Correct 141 ms 22820 KB Output is correct
22 Correct 133 ms 26712 KB Output is correct
23 Correct 141 ms 26696 KB Output is correct
24 Correct 119 ms 28420 KB Output is correct
25 Correct 134 ms 28424 KB Output is correct
26 Correct 135 ms 28136 KB Output is correct
27 Correct 141 ms 28236 KB Output is correct
28 Correct 141 ms 28124 KB Output is correct
29 Correct 155 ms 28020 KB Output is correct
30 Correct 154 ms 28064 KB Output is correct
31 Correct 152 ms 27964 KB Output is correct
32 Correct 163 ms 27984 KB Output is correct
33 Correct 172 ms 28116 KB Output is correct
34 Correct 112 ms 27720 KB Output is correct
35 Correct 111 ms 27912 KB Output is correct
36 Correct 104 ms 27480 KB Output is correct
37 Correct 112 ms 27504 KB Output is correct
38 Correct 107 ms 27732 KB Output is correct
39 Correct 143 ms 25544 KB Output is correct
40 Correct 110 ms 20208 KB Output is correct
41 Correct 130 ms 24568 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 3 ms 704 KB Output is correct
14 Correct 4 ms 724 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 3 ms 724 KB Output is correct
19 Correct 932 ms 97440 KB Output is correct
20 Correct 954 ms 97360 KB Output is correct
21 Correct 946 ms 97500 KB Output is correct
22 Correct 939 ms 97360 KB Output is correct
23 Correct 955 ms 107860 KB Output is correct
24 Correct 70 ms 9960 KB Output is correct
25 Correct 67 ms 10188 KB Output is correct
26 Correct 60 ms 11180 KB Output is correct
27 Correct 65 ms 12784 KB Output is correct
28 Correct 62 ms 12748 KB Output is correct
29 Correct 46 ms 12688 KB Output is correct
30 Correct 58 ms 12712 KB Output is correct
31 Correct 61 ms 11520 KB Output is correct
32 Correct 32 ms 5520 KB Output is correct
33 Correct 62 ms 11708 KB Output is correct
34 Correct 155 ms 19684 KB Output is correct
35 Correct 166 ms 19644 KB Output is correct
36 Correct 141 ms 22820 KB Output is correct
37 Correct 133 ms 26712 KB Output is correct
38 Correct 141 ms 26696 KB Output is correct
39 Correct 119 ms 28420 KB Output is correct
40 Correct 134 ms 28424 KB Output is correct
41 Correct 135 ms 28136 KB Output is correct
42 Correct 141 ms 28236 KB Output is correct
43 Correct 141 ms 28124 KB Output is correct
44 Correct 155 ms 28020 KB Output is correct
45 Correct 154 ms 28064 KB Output is correct
46 Correct 152 ms 27964 KB Output is correct
47 Correct 163 ms 27984 KB Output is correct
48 Correct 172 ms 28116 KB Output is correct
49 Correct 112 ms 27720 KB Output is correct
50 Correct 111 ms 27912 KB Output is correct
51 Correct 104 ms 27480 KB Output is correct
52 Correct 112 ms 27504 KB Output is correct
53 Correct 107 ms 27732 KB Output is correct
54 Correct 143 ms 25544 KB Output is correct
55 Correct 110 ms 20208 KB Output is correct
56 Correct 130 ms 24568 KB Output is correct
57 Correct 969 ms 131124 KB Output is correct
58 Correct 955 ms 131428 KB Output is correct
59 Correct 896 ms 132004 KB Output is correct
60 Correct 909 ms 131908 KB Output is correct
61 Correct 948 ms 131892 KB Output is correct
62 Correct 947 ms 131856 KB Output is correct
63 Correct 617 ms 140260 KB Output is correct
64 Correct 619 ms 140236 KB Output is correct
65 Correct 871 ms 140380 KB Output is correct
66 Correct 882 ms 140144 KB Output is correct
67 Correct 912 ms 140184 KB Output is correct
68 Correct 976 ms 139436 KB Output is correct
69 Correct 970 ms 139320 KB Output is correct
70 Correct 973 ms 139492 KB Output is correct
71 Correct 962 ms 139576 KB Output is correct
72 Correct 930 ms 139604 KB Output is correct
73 Correct 508 ms 134040 KB Output is correct
74 Correct 544 ms 135508 KB Output is correct
75 Correct 533 ms 134148 KB Output is correct
76 Correct 532 ms 134224 KB Output is correct
77 Correct 553 ms 134228 KB Output is correct
78 Correct 826 ms 128020 KB Output is correct
79 Correct 626 ms 92532 KB Output is correct
80 Correct 822 ms 121244 KB Output is correct