oj.uz

Submission #1057992

# Submission time Handle Problem Language Result Execution time Memory
1057992 2024-08-14T07:52:17 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 302 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
#define pb push_back
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]);
    if (l == m) st[id<<1].v.clear();
    if (m+1 == r) st[id<<1|1].v.clear();
}
void get(ll id, ll l, ll r, ll u, ll v)
{
    if (u <= l && r <= v)
    {
        if (l == r)
        {
            if (a[l] < f) ans = max(ans, a[l]+f);
            f = max(f, a[l]);
            return;
        }
        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:17:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     while (id_a < a.v.size() && id_b < b.v.size())
      |            ~~~~~^~~~~~~~~~~~
sortbooks.cpp:17:38: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     while (id_a < a.v.size() && id_b < b.v.size())
      |                                 ~~~~~^~~~~~~~~~~~
sortbooks.cpp:30:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     while (id_a < a.v.size())
      |            ~~~~~^~~~~~~~~~~~
sortbooks.cpp:35:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     while (id_b < b.v.size())
      |            ~~~~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 125532 KB Output is correct
2 Correct 18 ms 125520 KB Output is correct
3 Correct 18 ms 125532 KB Output is correct
4 Correct 21 ms 125604 KB Output is correct
5 Correct 19 ms 125528 KB Output is correct
6 Correct 18 ms 125528 KB Output is correct
7 Correct 20 ms 125532 KB Output is correct
8 Correct 20 ms 125532 KB Output is correct
9 Correct 18 ms 125516 KB Output is correct
10 Correct 20 ms 125528 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 18 ms 125520 KB Output is correct
3 Correct 18 ms 125532 KB Output is correct
4 Correct 21 ms 125604 KB Output is correct
5 Correct 19 ms 125528 KB Output is correct
6 Correct 18 ms 125528 KB Output is correct
7 Correct 20 ms 125532 KB Output is correct
8 Correct 20 ms 125532 KB Output is correct
9 Correct 18 ms 125516 KB Output is correct
10 Correct 20 ms 125528 KB Output is correct
11 Correct 19 ms 125784 KB Output is correct
12 Correct 20 ms 126300 KB Output is correct
13 Correct 21 ms 126300 KB Output is correct
14 Correct 21 ms 126188 KB Output is correct
15 Correct 25 ms 126300 KB Output is correct
16 Correct 22 ms 126296 KB Output is correct
17 Correct 21 ms 126044 KB Output is correct
18 Correct 20 ms 126044 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 302 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 126 ms 138284 KB Output is correct
2 Correct 100 ms 138392 KB Output is correct
3 Correct 74 ms 134412 KB Output is correct
4 Correct 76 ms 134236 KB Output is correct
5 Correct 73 ms 134236 KB Output is correct
6 Correct 69 ms 134232 KB Output is correct
7 Correct 63 ms 134380 KB Output is correct
8 Correct 61 ms 134236 KB Output is correct
9 Correct 38 ms 125952 KB Output is correct
10 Correct 60 ms 134228 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 18 ms 125520 KB Output is correct
3 Correct 18 ms 125532 KB Output is correct
4 Correct 21 ms 125604 KB Output is correct
5 Correct 19 ms 125528 KB Output is correct
6 Correct 18 ms 125528 KB Output is correct
7 Correct 20 ms 125532 KB Output is correct
8 Correct 20 ms 125532 KB Output is correct
9 Correct 18 ms 125516 KB Output is correct
10 Correct 20 ms 125528 KB Output is correct
11 Correct 19 ms 125784 KB Output is correct
12 Correct 20 ms 126300 KB Output is correct
13 Correct 21 ms 126300 KB Output is correct
14 Correct 21 ms 126188 KB Output is correct
15 Correct 25 ms 126300 KB Output is correct
16 Correct 22 ms 126296 KB Output is correct
17 Correct 21 ms 126044 KB Output is correct
18 Correct 20 ms 126044 KB Output is correct
19 Correct 237 ms 155460 KB Output is correct
20 Correct 228 ms 155340 KB Output is correct
21 Correct 209 ms 155336 KB Output is correct
22 Correct 208 ms 155336 KB Output is correct
23 Correct 205 ms 155336 KB Output is correct
24 Correct 196 ms 155340 KB Output is correct
25 Correct 180 ms 155336 KB Output is correct
26 Correct 177 ms 155336 KB Output is correct
27 Correct 189 ms 155336 KB Output is correct
28 Correct 192 ms 155336 KB Output is correct
29 Correct 188 ms 155340 KB Output is correct
30 Correct 189 ms 155340 KB Output is correct
31 Correct 204 ms 155828 KB Output is correct
32 Correct 191 ms 155468 KB Output is correct
33 Correct 184 ms 155332 KB Output is correct
34 Correct 164 ms 155340 KB Output is correct
35 Correct 158 ms 155340 KB Output is correct
36 Correct 160 ms 155340 KB Output is correct
37 Correct 160 ms 155380 KB Output is correct
38 Correct 181 ms 155340 KB Output is correct
39 Correct 175 ms 155324 KB Output is correct
40 Correct 120 ms 143816 KB Output is correct
41 Correct 122 ms 140632 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 18 ms 125520 KB Output is correct
3 Correct 18 ms 125532 KB Output is correct
4 Correct 21 ms 125604 KB Output is correct
5 Correct 19 ms 125528 KB Output is correct
6 Correct 18 ms 125528 KB Output is correct
7 Correct 20 ms 125532 KB Output is correct
8 Correct 20 ms 125532 KB Output is correct
9 Correct 18 ms 125516 KB Output is correct
10 Correct 20 ms 125528 KB Output is correct
11 Correct 19 ms 125784 KB Output is correct
12 Correct 20 ms 126300 KB Output is correct
13 Correct 21 ms 126300 KB Output is correct
14 Correct 21 ms 126188 KB Output is correct
15 Correct 25 ms 126300 KB Output is correct
16 Correct 22 ms 126296 KB Output is correct
17 Correct 21 ms 126044 KB Output is correct
18 Correct 20 ms 126044 KB Output is correct
19 Runtime error 302 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -