oj.uz

Submission #1057980

# Submission time Handle Problem Language Result Execution time Memory
1057980 2024-08-14T07:48:46 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 357 ms 262376 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;
};
void merge(node& c, node& a, node& b)
{
    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]) 
        {
            if (c.v.empty() || c.v.back() != a.v[id_a]) c.v.pb(a.v[id_a++]);
            else id_a++;
        }
        else 
        {
            if (c.v.empty() || b.v[id_b] != c.v.back()) c.v.pb(b.v[id_b++]);
            else id_b++;
        }
    } 
    while (id_a < a.v.size()) 
    {
        if (c.v.empty() || c.v.back() != a.v[id_a]) c.v.pb(a.v[id_a++]);
        else id_a++;
    }
    while (id_b < b.v.size()) 
    {
        if (c.v.empty() || b.v[id_b] != c.v.back()) c.v.pb(b.v[id_b++]);
        else id_b++;
    }
}
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);
    merge(st[id], 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 'void merge(node&, node&, node&)':
sortbooks.cpp:21:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     while (id_a < a.v.size() && id_b < b.v.size())
      |            ~~~~~^~~~~~~~~~~~
sortbooks.cpp:21:38: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     while (id_a < a.v.size() && id_b < b.v.size())
      |                                 ~~~~~^~~~~~~~~~~~
sortbooks.cpp:34:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     while (id_a < a.v.size())
      |            ~~~~~^~~~~~~~~~~~
sortbooks.cpp:39:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     while (id_b < b.v.size())
      |            ~~~~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 125528 KB Output is correct
2 Correct 19 ms 125504 KB Output is correct
3 Correct 19 ms 125720 KB Output is correct
4 Correct 19 ms 125532 KB Output is correct
5 Correct 23 ms 125508 KB Output is correct
6 Correct 20 ms 125700 KB Output is correct
7 Correct 20 ms 125532 KB Output is correct
8 Correct 23 ms 125656 KB Output is correct
9 Correct 23 ms 125608 KB Output is correct
10 Correct 18 ms 125532 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 125528 KB Output is correct
2 Correct 19 ms 125504 KB Output is correct
3 Correct 19 ms 125720 KB Output is correct
4 Correct 19 ms 125532 KB Output is correct
5 Correct 23 ms 125508 KB Output is correct
6 Correct 20 ms 125700 KB Output is correct
7 Correct 20 ms 125532 KB Output is correct
8 Correct 23 ms 125656 KB Output is correct
9 Correct 23 ms 125608 KB Output is correct
10 Correct 18 ms 125532 KB Output is correct
11 Correct 22 ms 125864 KB Output is correct
12 Correct 22 ms 126144 KB Output is correct
13 Correct 24 ms 126300 KB Output is correct
14 Correct 26 ms 126352 KB Output is correct
15 Correct 24 ms 126400 KB Output is correct
16 Correct 24 ms 126264 KB Output is correct
17 Correct 23 ms 126044 KB Output is correct
18 Correct 22 ms 125888 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 357 ms 262376 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 131 ms 138252 KB Output is correct
2 Correct 119 ms 138504 KB Output is correct
3 Correct 80 ms 134328 KB Output is correct
4 Correct 73 ms 134236 KB Output is correct
5 Correct 82 ms 134224 KB Output is correct
6 Correct 66 ms 134488 KB Output is correct
7 Correct 72 ms 134236 KB Output is correct
8 Correct 68 ms 134388 KB Output is correct
9 Correct 38 ms 125784 KB Output is correct
10 Correct 60 ms 134236 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 125528 KB Output is correct
2 Correct 19 ms 125504 KB Output is correct
3 Correct 19 ms 125720 KB Output is correct
4 Correct 19 ms 125532 KB Output is correct
5 Correct 23 ms 125508 KB Output is correct
6 Correct 20 ms 125700 KB Output is correct
7 Correct 20 ms 125532 KB Output is correct
8 Correct 23 ms 125656 KB Output is correct
9 Correct 23 ms 125608 KB Output is correct
10 Correct 18 ms 125532 KB Output is correct
11 Correct 22 ms 125864 KB Output is correct
12 Correct 22 ms 126144 KB Output is correct
13 Correct 24 ms 126300 KB Output is correct
14 Correct 26 ms 126352 KB Output is correct
15 Correct 24 ms 126400 KB Output is correct
16 Correct 24 ms 126264 KB Output is correct
17 Correct 23 ms 126044 KB Output is correct
18 Correct 22 ms 125888 KB Output is correct
19 Correct 257 ms 155336 KB Output is correct
20 Correct 241 ms 155336 KB Output is correct
21 Correct 214 ms 155336 KB Output is correct
22 Correct 212 ms 155524 KB Output is correct
23 Correct 209 ms 155324 KB Output is correct
24 Correct 165 ms 155340 KB Output is correct
25 Correct 189 ms 155424 KB Output is correct
26 Correct 210 ms 155420 KB Output is correct
27 Correct 213 ms 155340 KB Output is correct
28 Correct 198 ms 155336 KB Output is correct
29 Correct 191 ms 155348 KB Output is correct
30 Correct 234 ms 155328 KB Output is correct
31 Correct 196 ms 155340 KB Output is correct
32 Correct 210 ms 155352 KB Output is correct
33 Correct 215 ms 155784 KB Output is correct
34 Correct 212 ms 155336 KB Output is correct
35 Correct 158 ms 155336 KB Output is correct
36 Correct 165 ms 155340 KB Output is correct
37 Correct 160 ms 155428 KB Output is correct
38 Correct 160 ms 155464 KB Output is correct
39 Correct 214 ms 155460 KB Output is correct
40 Correct 120 ms 143816 KB Output is correct
41 Correct 143 ms 140624 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 125528 KB Output is correct
2 Correct 19 ms 125504 KB Output is correct
3 Correct 19 ms 125720 KB Output is correct
4 Correct 19 ms 125532 KB Output is correct
5 Correct 23 ms 125508 KB Output is correct
6 Correct 20 ms 125700 KB Output is correct
7 Correct 20 ms 125532 KB Output is correct
8 Correct 23 ms 125656 KB Output is correct
9 Correct 23 ms 125608 KB Output is correct
10 Correct 18 ms 125532 KB Output is correct
11 Correct 22 ms 125864 KB Output is correct
12 Correct 22 ms 126144 KB Output is correct
13 Correct 24 ms 126300 KB Output is correct
14 Correct 26 ms 126352 KB Output is correct
15 Correct 24 ms 126400 KB Output is correct
16 Correct 24 ms 126264 KB Output is correct
17 Correct 23 ms 126044 KB Output is correct
18 Correct 22 ms 125888 KB Output is correct
19 Runtime error 357 ms 262376 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -