oj.uz

Submission #1057934

# Submission time Handle Problem Language Result Execution time Memory
1057934 2024-08-14T07:25:58 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 338 ms 262252 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 125532 KB Output is correct
2 Correct 19 ms 125568 KB Output is correct
3 Correct 19 ms 125552 KB Output is correct
4 Correct 20 ms 125532 KB Output is correct
5 Correct 19 ms 125532 KB Output is correct
6 Correct 19 ms 125532 KB Output is correct
7 Correct 19 ms 125532 KB Output is correct
8 Correct 19 ms 125528 KB Output is correct
9 Correct 19 ms 125532 KB Output is correct
10 Correct 20 ms 125704 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 125568 KB Output is correct
3 Correct 19 ms 125552 KB Output is correct
4 Correct 20 ms 125532 KB Output is correct
5 Correct 19 ms 125532 KB Output is correct
6 Correct 19 ms 125532 KB Output is correct
7 Correct 19 ms 125532 KB Output is correct
8 Correct 19 ms 125528 KB Output is correct
9 Correct 19 ms 125532 KB Output is correct
10 Correct 20 ms 125704 KB Output is correct
11 Correct 20 ms 125788 KB Output is correct
12 Correct 21 ms 126152 KB Output is correct
13 Correct 24 ms 126300 KB Output is correct
14 Correct 23 ms 126300 KB Output is correct
15 Correct 22 ms 126300 KB Output is correct
16 Correct 21 ms 126252 KB Output is correct
17 Correct 22 ms 126048 KB Output is correct
18 Correct 21 ms 126044 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 338 ms 262252 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 100 ms 138328 KB Output is correct
2 Correct 95 ms 138324 KB Output is correct
3 Correct 73 ms 134404 KB Output is correct
4 Correct 74 ms 134232 KB Output is correct
5 Correct 92 ms 134356 KB Output is correct
6 Correct 65 ms 134236 KB Output is correct
7 Correct 66 ms 134228 KB Output is correct
8 Correct 65 ms 134236 KB Output is correct
9 Correct 39 ms 125920 KB Output is correct
10 Correct 61 ms 134236 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 125568 KB Output is correct
3 Correct 19 ms 125552 KB Output is correct
4 Correct 20 ms 125532 KB Output is correct
5 Correct 19 ms 125532 KB Output is correct
6 Correct 19 ms 125532 KB Output is correct
7 Correct 19 ms 125532 KB Output is correct
8 Correct 19 ms 125528 KB Output is correct
9 Correct 19 ms 125532 KB Output is correct
10 Correct 20 ms 125704 KB Output is correct
11 Correct 20 ms 125788 KB Output is correct
12 Correct 21 ms 126152 KB Output is correct
13 Correct 24 ms 126300 KB Output is correct
14 Correct 23 ms 126300 KB Output is correct
15 Correct 22 ms 126300 KB Output is correct
16 Correct 21 ms 126252 KB Output is correct
17 Correct 22 ms 126048 KB Output is correct
18 Correct 21 ms 126044 KB Output is correct
19 Correct 256 ms 155328 KB Output is correct
20 Correct 253 ms 155588 KB Output is correct
21 Correct 207 ms 155340 KB Output is correct
22 Correct 206 ms 155340 KB Output is correct
23 Correct 243 ms 155468 KB Output is correct
24 Correct 169 ms 155500 KB Output is correct
25 Correct 172 ms 155348 KB Output is correct
26 Correct 193 ms 155592 KB Output is correct
27 Correct 191 ms 155336 KB Output is correct
28 Correct 231 ms 155340 KB Output is correct
29 Correct 253 ms 155340 KB Output is correct
30 Correct 204 ms 155484 KB Output is correct
31 Correct 204 ms 155340 KB Output is correct
32 Correct 197 ms 155340 KB Output is correct
33 Correct 210 ms 155592 KB Output is correct
34 Correct 158 ms 155456 KB Output is correct
35 Correct 165 ms 155600 KB Output is correct
36 Correct 174 ms 155340 KB Output is correct
37 Correct 163 ms 155328 KB Output is correct
38 Correct 167 ms 155336 KB Output is correct
39 Correct 179 ms 155336 KB Output is correct
40 Correct 119 ms 143760 KB Output is correct
41 Correct 122 ms 140628 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 125568 KB Output is correct
3 Correct 19 ms 125552 KB Output is correct
4 Correct 20 ms 125532 KB Output is correct
5 Correct 19 ms 125532 KB Output is correct
6 Correct 19 ms 125532 KB Output is correct
7 Correct 19 ms 125532 KB Output is correct
8 Correct 19 ms 125528 KB Output is correct
9 Correct 19 ms 125532 KB Output is correct
10 Correct 20 ms 125704 KB Output is correct
11 Correct 20 ms 125788 KB Output is correct
12 Correct 21 ms 126152 KB Output is correct
13 Correct 24 ms 126300 KB Output is correct
14 Correct 23 ms 126300 KB Output is correct
15 Correct 22 ms 126300 KB Output is correct
16 Correct 21 ms 126252 KB Output is correct
17 Correct 22 ms 126048 KB Output is correct
18 Correct 21 ms 126044 KB Output is correct
19 Runtime error 338 ms 262252 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -