oj.uz

Submission #145602

# Submission time Handle Problem Language Result Execution time Memory
145602 2019-08-20T13:40:49 Z MladenP Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
0 / 100
 1612 ms 60412 KB 
#include<bits/stdc++.h>
#define STIZE(x) fprintf(stderr, "STIZE%d\n", x);
#define PRINT(x) fprintf(stderr, "%s = %d\n", #x, x);
#define NL(x) printf("%c", " \n"[(x)]);
#define lld long long
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
#define mid (l+r)/2
#define endl '\n'
#define all(a) begin(a),end(a)
#define sz(a) int((a).size())
#define LINF 1000000000000000LL
#define INF 1000000000
#define EPS 1e-9
using namespace std;
#define MAXN 1000010
int N, M, a[MAXN], rez[MAXN], seg[4*MAXN];
stack<int> st;
vector<pii> p;
struct Query{
    int l, r, k, idx;
    Query() { l = r = k = idx = 0; }
    Query(int _l, int _r, int _k, int _idx) { l = _l; r = _r; k = _k; idx = _idx; }
}q[MAXN];
void update(int node, int l, int r, int idx, int val) {
    if(l == r) {
        seg[node] = max(seg[node], val);
        return;
    }
    if(idx <= mid) update(2*node, l, mid, idx, val);
    else update(2*node+1, mid+1, r, idx, val);
    seg[node] = max(seg[2*node], seg[2*node+1]);
}
int query(int node, int l, int r, int L, int R) {
    if(L <= l && r <= R) return seg[node];
    int rez = 0;
    if(L <= mid) rez = max(rez, query(2*node, l, mid, L, R));
    if(R > mid) rez = max(rez, query(2*node+1, mid+1, r, L, R));
    return rez;
}
bool cmp1(Query a, Query b) {
    return a.l > b.l;
}
bool cmp2(pii a, pii b) {
    return a.fi > b.fi;
}
int main() {
    ios::sync_with_stdio(false);cin.tie(0);
    cin >> N >> M;
    a[0] = INF+1;
    st.push(0);
    for(int i = 1; i <= N; i++) {
        cin >> a[i];
        while(a[i] > a[st.top()]) st.pop();
        p.pb({st.top(), i});
        st.push(i);
    }
    for(int i = 1; i <= M; i++) {
        cin >> q[i].l >> q[i].r >> q[i].k;
        q[i].idx = i;
    }
    sort(q+1, q+1+M, cmp1);
    sort(all(p), cmp2);
    int id = 0;
    for(int i = 1; i <= M; i++) {
        int l = q[i].l, r = q[i].r, k = q[i].k, idx = q[i].idx;
        while(id < N && l <= p[id].fi) {
            update(1, 1, N, p[id].se, a[p[id].fi]+a[p[id].se]);
            id++;
        }
        rez[idx] = (query(1, 1, N, l, r) <= k);
    }
    for(int i = 1; i <= M; i++) cout << rez[i] << endl;
    return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 15992 KB Output is correct
2 Correct 16 ms 16040 KB Output is correct
3 Correct 16 ms 15964 KB Output is correct
4 Correct 16 ms 15992 KB Output is correct
5 Correct 16 ms 15992 KB Output is correct
6 Correct 16 ms 16124 KB Output is correct
7 Correct 16 ms 15992 KB Output is correct
8 Correct 16 ms 16120 KB Output is correct
9 Correct 16 ms 15992 KB Output is correct
10 Incorrect 16 ms 16120 KB Output isn't correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 15992 KB Output is correct
2 Correct 16 ms 16040 KB Output is correct
3 Correct 16 ms 15964 KB Output is correct
4 Correct 16 ms 15992 KB Output is correct
5 Correct 16 ms 15992 KB Output is correct
6 Correct 16 ms 16124 KB Output is correct
7 Correct 16 ms 15992 KB Output is correct
8 Correct 16 ms 16120 KB Output is correct
9 Correct 16 ms 15992 KB Output is correct
10 Incorrect 16 ms 16120 KB Output isn't correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1607 ms 60412 KB Output is correct
2 Correct 1612 ms 52008 KB Output is correct
3 Correct 1597 ms 55088 KB Output is correct
4 Correct 1612 ms 55124 KB Output is correct
5 Incorrect 1410 ms 54972 KB Output isn't correct

Subtask #4
0 / 17.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 15992 KB Output is correct
2 Correct 16 ms 16040 KB Output is correct
3 Correct 16 ms 15964 KB Output is correct
4 Correct 16 ms 15992 KB Output is correct
5 Correct 16 ms 15992 KB Output is correct
6 Correct 16 ms 16124 KB Output is correct
7 Correct 16 ms 15992 KB Output is correct
8 Correct 16 ms 16120 KB Output is correct
9 Correct 16 ms 15992 KB Output is correct
10 Incorrect 16 ms 16120 KB Output isn't correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 15992 KB Output is correct
2 Correct 16 ms 16040 KB Output is correct
3 Correct 16 ms 15964 KB Output is correct
4 Correct 16 ms 15992 KB Output is correct
5 Correct 16 ms 15992 KB Output is correct
6 Correct 16 ms 16124 KB Output is correct
7 Correct 16 ms 15992 KB Output is correct
8 Correct 16 ms 16120 KB Output is correct
9 Correct 16 ms 15992 KB Output is correct
10 Incorrect 16 ms 16120 KB Output isn't correct