oj.uz

답안 #152617

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
152617 2019-09-08T15:10:27 Z leatherman Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 733 ms 262148 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 = 1e6 + 2;

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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 2 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 2 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 1016 KB Output is correct
12 Correct 10 ms 2936 KB Output is correct
13 Correct 10 ms 2936 KB Output is correct
14 Correct 13 ms 3068 KB Output is correct
15 Correct 12 ms 2936 KB Output is correct
16 Correct 8 ms 1660 KB Output is correct
17 Correct 7 ms 1272 KB Output is correct
18 Correct 10 ms 2424 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 615 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 331 ms 66564 KB Output is correct
2 Correct 280 ms 66548 KB Output is correct
3 Correct 170 ms 11884 KB Output is correct
4 Correct 166 ms 11884 KB Output is correct
5 Correct 172 ms 12068 KB Output is correct
6 Correct 115 ms 17388 KB Output is correct
7 Correct 114 ms 17392 KB Output is correct
8 Correct 214 ms 51048 KB Output is correct
9 Correct 54 ms 608 KB Output is correct
10 Correct 196 ms 43248 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 2 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 1016 KB Output is correct
12 Correct 10 ms 2936 KB Output is correct
13 Correct 10 ms 2936 KB Output is correct
14 Correct 13 ms 3068 KB Output is correct
15 Correct 12 ms 2936 KB Output is correct
16 Correct 8 ms 1660 KB Output is correct
17 Correct 7 ms 1272 KB Output is correct
18 Correct 10 ms 2424 KB Output is correct
19 Correct 733 ms 139136 KB Output is correct
20 Correct 730 ms 139020 KB Output is correct
21 Correct 602 ms 139136 KB Output is correct
22 Correct 601 ms 139040 KB Output is correct
23 Correct 586 ms 139024 KB Output is correct
24 Correct 266 ms 23420 KB Output is correct
25 Correct 264 ms 23592 KB Output is correct
26 Correct 386 ms 23476 KB Output is correct
27 Correct 388 ms 23476 KB Output is correct
28 Correct 388 ms 23480 KB Output is correct
29 Correct 402 ms 23440 KB Output is correct
30 Correct 404 ms 23532 KB Output is correct
31 Correct 407 ms 23552 KB Output is correct
32 Correct 434 ms 23520 KB Output is correct
33 Correct 424 ms 23400 KB Output is correct
34 Correct 232 ms 23516 KB Output is correct
35 Correct 231 ms 23464 KB Output is correct
36 Correct 232 ms 23432 KB Output is correct
37 Correct 232 ms 23524 KB Output is correct
38 Correct 233 ms 23528 KB Output is correct
39 Correct 422 ms 62548 KB Output is correct
40 Correct 274 ms 33900 KB Output is correct
41 Correct 440 ms 89504 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 2 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 1016 KB Output is correct
12 Correct 10 ms 2936 KB Output is correct
13 Correct 10 ms 2936 KB Output is correct
14 Correct 13 ms 3068 KB Output is correct
15 Correct 12 ms 2936 KB Output is correct
16 Correct 8 ms 1660 KB Output is correct
17 Correct 7 ms 1272 KB Output is correct
18 Correct 10 ms 2424 KB Output is correct
19 Runtime error 615 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
20 Halted 0 ms 0 KB -