oj.uz

Submission #1057890

# Submission time Handle Problem Language Result Execution time Memory
1057890 2024-08-14T07:10:03 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 323 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef long double ld;
#define pb push_back
#define pf push_front
#define fi first
#define se second
const ll mod = 1e9+7, mxn = 1e6+7;
struct node 
{
    vector<ll> v;
    ll ans = -mod;
};
node merge(node const a, node const b)
{
    node c;
    c.ans = max({a.ans, b.ans});
    ll p = lower_bound(b.v.begin(), b.v.end(), a.v.back())-b.v.begin()-1;
    if (p >= 0) c.ans = max({c.ans,b.v[p]+a.v.back()});
    ll id_a = 0, id_b = 0;
    while (id_a < a.v.size() && id_b < b.v.size())
    {
        if (a.v[id_a] < b.v[id_b]) c.v.pb(a.v[id_a++]);
        else c.v.pb(b.v[id_b++]);
    } 
    while (id_a < a.v.size()) c.v.pb(a.v[id_a++]);
    while (id_b < b.v.size()) c.v.pb(b.v[id_b++]);
    return c;
}
vector<node> st(mxn<<2);
ll a[mxn], n, q, ans, f;
void build(ll id, ll l, ll r)
{
    if (l == r) {st[id].v = {a[l]}; return;}
    ll m = (r+l)>>1;
    build(id<<1,l,m); build(id<<1|1,m+1,r);
    st[id] = merge(st[id<<1], st[id<<1|1]);
}
void get(ll id, ll l, ll r, ll u, ll v)
{
    if (u <= l && r <= v)
    {
        ans = max({ans, st[id].ans});
        ll p = lower_bound(st[id].v.begin(), st[id].v.end(), f)-st[id].v.begin()-1;
        if (p >= 0) ans = max({ans, st[id].v[p]+f});
        f = max(f, st[id].v.back());
        return ;
    }
    ll m = (r+l)>>1;
    if (v <= m) get(id<<1,l,m,u,v);
    else if (m+1 <= u) get(id<<1|1,m+1,r,u,v);
    else {get(id<<1,l,m,u,v); get(id<<1|1,m+1,r,u,v);}
}
signed main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    // freopen("test.inp","r",stdin); freopen("test.out","w",stdout); freopen("test.err","w",stderr);
    cin >> n >> q;
    for (ll i = 1; i <= n; i++) cin >> a[i];
    build(1,1,n);
    while (q--)
    {
        ll l, r, k; cin >> l >> r >> k; ans = 0; f = -mod; get(1,1,n,l,r);
        cout << (ans <= k) << '\n';
    }
}

Compilation message

sortbooks.cpp: In function 'node merge(node, node)':
sortbooks.cpp:22:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     while (id_a < a.v.size() && id_b < b.v.size())
      |            ~~~~~^~~~~~~~~~~~
sortbooks.cpp:22:38: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     while (id_a < a.v.size() && id_b < b.v.size())
      |                                 ~~~~~^~~~~~~~~~~~
sortbooks.cpp:27:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     while (id_a < a.v.size()) c.v.pb(a.v[id_a++]);
      |            ~~~~~^~~~~~~~~~~~
sortbooks.cpp:28:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     while (id_b < b.v.size()) c.v.pb(b.v[id_b++]);
      |            ~~~~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 125532 KB Output is correct
2 Correct 19 ms 125532 KB Output is correct
3 Correct 19 ms 125568 KB Output is correct
4 Correct 19 ms 125532 KB Output is correct
5 Correct 20 ms 125656 KB Output is correct
6 Correct 19 ms 125748 KB Output is correct
7 Correct 19 ms 125604 KB Output is correct
8 Correct 19 ms 125528 KB Output is correct
9 Correct 20 ms 125528 KB Output is correct
10 Correct 21 ms 125532 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 125532 KB Output is correct
2 Correct 19 ms 125532 KB Output is correct
3 Correct 19 ms 125568 KB Output is correct
4 Correct 19 ms 125532 KB Output is correct
5 Correct 20 ms 125656 KB Output is correct
6 Correct 19 ms 125748 KB Output is correct
7 Correct 19 ms 125604 KB Output is correct
8 Correct 19 ms 125528 KB Output is correct
9 Correct 20 ms 125528 KB Output is correct
10 Correct 21 ms 125532 KB Output is correct
11 Correct 21 ms 125784 KB Output is correct
12 Correct 21 ms 126300 KB Output is correct
13 Correct 21 ms 126300 KB Output is correct
14 Correct 23 ms 126300 KB Output is correct
15 Correct 22 ms 126260 KB Output is correct
16 Correct 22 ms 126296 KB Output is correct
17 Correct 21 ms 126044 KB Output is correct
18 Correct 21 ms 126296 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 323 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 141616 KB Output is correct
2 Correct 103 ms 141612 KB Output is correct
3 Correct 92 ms 141612 KB Output is correct
4 Correct 95 ms 141616 KB Output is correct
5 Correct 100 ms 141556 KB Output is correct
6 Correct 84 ms 141820 KB Output is correct
7 Correct 83 ms 141616 KB Output is correct
8 Correct 84 ms 141824 KB Output is correct
9 Correct 39 ms 125784 KB Output is correct
10 Correct 85 ms 141616 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 125532 KB Output is correct
2 Correct 19 ms 125532 KB Output is correct
3 Correct 19 ms 125568 KB Output is correct
4 Correct 19 ms 125532 KB Output is correct
5 Correct 20 ms 125656 KB Output is correct
6 Correct 19 ms 125748 KB Output is correct
7 Correct 19 ms 125604 KB Output is correct
8 Correct 19 ms 125528 KB Output is correct
9 Correct 20 ms 125528 KB Output is correct
10 Correct 21 ms 125532 KB Output is correct
11 Correct 21 ms 125784 KB Output is correct
12 Correct 21 ms 126300 KB Output is correct
13 Correct 21 ms 126300 KB Output is correct
14 Correct 23 ms 126300 KB Output is correct
15 Correct 22 ms 126260 KB Output is correct
16 Correct 22 ms 126296 KB Output is correct
17 Correct 21 ms 126044 KB Output is correct
18 Correct 21 ms 126296 KB Output is correct
19 Correct 244 ms 156396 KB Output is correct
20 Correct 270 ms 156396 KB Output is correct
21 Correct 208 ms 156392 KB Output is correct
22 Correct 207 ms 156392 KB Output is correct
23 Correct 208 ms 156392 KB Output is correct
24 Correct 176 ms 156392 KB Output is correct
25 Correct 175 ms 156392 KB Output is correct
26 Correct 192 ms 156392 KB Output is correct
27 Correct 187 ms 156396 KB Output is correct
28 Correct 233 ms 156396 KB Output is correct
29 Correct 194 ms 156392 KB Output is correct
30 Correct 211 ms 156368 KB Output is correct
31 Correct 214 ms 156276 KB Output is correct
32 Correct 210 ms 156260 KB Output is correct
33 Correct 250 ms 156392 KB Output is correct
34 Correct 171 ms 156392 KB Output is correct
35 Correct 167 ms 156288 KB Output is correct
36 Correct 189 ms 156400 KB Output is correct
37 Correct 171 ms 156236 KB Output is correct
38 Correct 166 ms 156408 KB Output is correct
39 Correct 228 ms 156400 KB Output is correct
40 Correct 139 ms 144076 KB Output is correct
41 Correct 183 ms 156392 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 125532 KB Output is correct
2 Correct 19 ms 125532 KB Output is correct
3 Correct 19 ms 125568 KB Output is correct
4 Correct 19 ms 125532 KB Output is correct
5 Correct 20 ms 125656 KB Output is correct
6 Correct 19 ms 125748 KB Output is correct
7 Correct 19 ms 125604 KB Output is correct
8 Correct 19 ms 125528 KB Output is correct
9 Correct 20 ms 125528 KB Output is correct
10 Correct 21 ms 125532 KB Output is correct
11 Correct 21 ms 125784 KB Output is correct
12 Correct 21 ms 126300 KB Output is correct
13 Correct 21 ms 126300 KB Output is correct
14 Correct 23 ms 126300 KB Output is correct
15 Correct 22 ms 126260 KB Output is correct
16 Correct 22 ms 126296 KB Output is correct
17 Correct 21 ms 126044 KB Output is correct
18 Correct 21 ms 126296 KB Output is correct
19 Runtime error 323 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -