oj.uz

Submission #152614

# Submission time Handle Problem Language Result Execution time Memory
152614 2019-09-08T15:08:19 Z leatherman Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 733 ms 145656 KB 
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#define ll int
#define ld long double
#define endl "\n"
#define fi first
#define se second
#define y1 sadjfskldf
#define PB push_back
#define sqr(x) ((x) * (x))
#define all(x) x.begin(), x.end()
using namespace std;
using namespace __gnu_pbds;
mt19937_64 rnd(chrono::system_clock::now().time_since_epoch().count());

const ll N = 2e5 + 200;

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

struct node
{
    ll val;
    node *l,*r;
    node() : val(0), l(nullptr), r(nullptr){}
};
node *root[N],*mb;
ll n,Q,a[N],x,pos;
vector<pair<ll, ll> > v;
void build(node *v,ll tl,ll tr)
{
    if(tl == tr) return;
    ll tm = (tl + tr) / 2;
    v -> l = new node();
    v -> r = new node();
    build(v -> l, tl, tm);
    build(v -> r, tm + 1, tr);
}
void upd(node *old, node *now,ll tl,ll tr,ll pos,ll val)
{
    if(tl == tr)
    {
        now -> val = val;
        return;
    }
    now -> l = old -> l;
    now -> r = old -> r;
    ll tm = (tl + tr) / 2;
    if(pos <= tm)
    {
        now -> l = new node();
        upd(old -> l, now -> l, tl, tm, pos, val);
    } else
    {
        now -> r= new node();
        upd(old -> r, now -> r, tm + 1, tr, pos, val);
    }
    now -> val = max((now -> l) -> val, (now -> r) -> val);
}
ll get(node *v,ll tl,ll tr,ll l,ll r)
{
    if(l > r) return 0;
    if(tl == l && tr == r) return v -> val;
    ll tm = (tl + tr) / 2;
    return max(get(v -> l, tl, tm, l, min(r, tm)), get(v -> r, tm + 1, tr, max(l, tm + 1), r));
}
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>n>>Q;
    for(int i = 1; i <= n; i++) cin>>a[i];
    root[n + 1] = new node();
    build(root[n + 1], 1, n);
    for(int i = n; i >= 1; i--)
    {
        x = a[i];
        root[i] = new node();
        root[i] -> val = root[i + 1] -> val;
        root[i] -> l = root[i + 1] -> l;
        root[i] -> r = root[i + 1] -> r;
        while(!v.empty() && v.back().fi < x)
        {
            pos = v.back().se;
            mb = new node();
            upd(root[i], mb, 1, n, pos, a[pos] + x);
            root[i] = mb;
            v.pop_back();
        }
        v.PB({x, i});
    }
    while(Q--)
    {
        ll l,r,k;
        cin>>l>>r>>k;
        x = get(root[l], 1, n, l, r);
        cout<<(x <= k)<<endl;
    }
    return 0;
}
/*
5 2
3 5 1 8 2
1 3 6
2 5 3
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 6 ms 1144 KB Output is correct
12 Correct 10 ms 3064 KB Output is correct
13 Correct 10 ms 3064 KB Output is correct
14 Correct 12 ms 3192 KB Output is correct
15 Correct 12 ms 3064 KB Output is correct
16 Correct 9 ms 1784 KB Output is correct
17 Correct 7 ms 1400 KB Output is correct
18 Correct 9 ms 2424 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 88 ms 5240 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 326 ms 66624 KB Output is correct
2 Correct 297 ms 68428 KB Output is correct
3 Correct 167 ms 14088 KB Output is correct
4 Correct 211 ms 13960 KB Output is correct
5 Correct 169 ms 13932 KB Output is correct
6 Correct 115 ms 19180 KB Output is correct
7 Correct 115 ms 19308 KB Output is correct
8 Correct 217 ms 52716 KB Output is correct
9 Correct 53 ms 1912 KB Output is correct
10 Correct 207 ms 44912 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 6 ms 1144 KB Output is correct
12 Correct 10 ms 3064 KB Output is correct
13 Correct 10 ms 3064 KB Output is correct
14 Correct 12 ms 3192 KB Output is correct
15 Correct 12 ms 3064 KB Output is correct
16 Correct 9 ms 1784 KB Output is correct
17 Correct 7 ms 1400 KB Output is correct
18 Correct 9 ms 2424 KB Output is correct
19 Correct 727 ms 145588 KB Output is correct
20 Correct 733 ms 145656 KB Output is correct
21 Correct 596 ms 145400 KB Output is correct
22 Correct 566 ms 145372 KB Output is correct
23 Correct 559 ms 145372 KB Output is correct
24 Correct 259 ms 29796 KB Output is correct
25 Correct 267 ms 29836 KB Output is correct
26 Correct 390 ms 29900 KB Output is correct
27 Correct 383 ms 30024 KB Output is correct
28 Correct 424 ms 29976 KB Output is correct
29 Correct 436 ms 30308 KB Output is correct
30 Correct 416 ms 30052 KB Output is correct
31 Correct 420 ms 30112 KB Output is correct
32 Correct 433 ms 30156 KB Output is correct
33 Correct 422 ms 30296 KB Output is correct
34 Correct 235 ms 29704 KB Output is correct
35 Correct 234 ms 29728 KB Output is correct
36 Correct 233 ms 29564 KB Output is correct
37 Correct 244 ms 29416 KB Output is correct
38 Correct 235 ms 29676 KB Output is correct
39 Correct 394 ms 67244 KB Output is correct
40 Correct 291 ms 38392 KB Output is correct
41 Correct 471 ms 94252 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 6 ms 1144 KB Output is correct
12 Correct 10 ms 3064 KB Output is correct
13 Correct 10 ms 3064 KB Output is correct
14 Correct 12 ms 3192 KB Output is correct
15 Correct 12 ms 3064 KB Output is correct
16 Correct 9 ms 1784 KB Output is correct
17 Correct 7 ms 1400 KB Output is correct
18 Correct 9 ms 2424 KB Output is correct
19 Runtime error 88 ms 5240 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Halted 0 ms 0 KB -