oj.uz

답안 #1057881

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057881 2024-08-14T07:05:30 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 311 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 mx = -mod, ans = -mod;
};
node merge(node const a, node const b)
{
    node c;
    c.mx = max(a.mx, b.mx);
    c.ans = max({a.ans, b.ans});
    ll p = lower_bound(b.v.begin(), b.v.end(), a.mx)-b.v.begin()-1;
    if (p >= 0) c.ans = max({c.ans,b.v[p]+a.mx});
    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].mx = a[l]; 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].mx);
        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:23:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     while (id_a < a.v.size() && id_b < b.v.size())
      |            ~~~~~^~~~~~~~~~~~
sortbooks.cpp:23:38: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     while (id_a < a.v.size() && id_b < b.v.size())
      |                                 ~~~~~^~~~~~~~~~~~
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_a < a.v.size()) c.v.pb(a.v[id_a++]);
      |            ~~~~~^~~~~~~~~~~~
sortbooks.cpp:29:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     while (id_b < b.v.size()) c.v.pb(b.v[id_b++]);
      |            ~~~~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 125532 KB Output is correct
2 Correct 18 ms 125492 KB Output is correct
3 Correct 18 ms 125528 KB Output is correct
4 Correct 18 ms 125676 KB Output is correct
5 Correct 20 ms 125532 KB Output is correct
6 Correct 20 ms 125532 KB Output is correct
7 Correct 18 ms 125580 KB Output is correct
8 Correct 19 ms 125532 KB Output is correct
9 Correct 18 ms 125528 KB Output is correct
10 Correct 19 ms 125528 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 125532 KB Output is correct
2 Correct 18 ms 125492 KB Output is correct
3 Correct 18 ms 125528 KB Output is correct
4 Correct 18 ms 125676 KB Output is correct
5 Correct 20 ms 125532 KB Output is correct
6 Correct 20 ms 125532 KB Output is correct
7 Correct 18 ms 125580 KB Output is correct
8 Correct 19 ms 125532 KB Output is correct
9 Correct 18 ms 125528 KB Output is correct
10 Correct 19 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 22 ms 126296 KB Output is correct
15 Correct 21 ms 126300 KB Output is correct
16 Correct 21 ms 126300 KB Output is correct
17 Correct 20 ms 126044 KB Output is correct
18 Correct 22 ms 126300 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 311 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 125 ms 141612 KB Output is correct
2 Correct 105 ms 143396 KB Output is correct
3 Correct 102 ms 143664 KB Output is correct
4 Correct 93 ms 143432 KB Output is correct
5 Correct 90 ms 143612 KB Output is correct
6 Correct 84 ms 143316 KB Output is correct
7 Correct 80 ms 143404 KB Output is correct
8 Correct 83 ms 143128 KB Output is correct
9 Correct 38 ms 127276 KB Output is correct
10 Correct 84 ms 143268 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 125532 KB Output is correct
2 Correct 18 ms 125492 KB Output is correct
3 Correct 18 ms 125528 KB Output is correct
4 Correct 18 ms 125676 KB Output is correct
5 Correct 20 ms 125532 KB Output is correct
6 Correct 20 ms 125532 KB Output is correct
7 Correct 18 ms 125580 KB Output is correct
8 Correct 19 ms 125532 KB Output is correct
9 Correct 18 ms 125528 KB Output is correct
10 Correct 19 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 22 ms 126296 KB Output is correct
15 Correct 21 ms 126300 KB Output is correct
16 Correct 21 ms 126300 KB Output is correct
17 Correct 20 ms 126044 KB Output is correct
18 Correct 22 ms 126300 KB Output is correct
19 Correct 251 ms 159928 KB Output is correct
20 Correct 244 ms 162260 KB Output is correct
21 Correct 214 ms 162200 KB Output is correct
22 Correct 228 ms 162260 KB Output is correct
23 Correct 221 ms 162264 KB Output is correct
24 Correct 171 ms 162008 KB Output is correct
25 Correct 185 ms 162004 KB Output is correct
26 Correct 209 ms 162264 KB Output is correct
27 Correct 189 ms 162264 KB Output is correct
28 Correct 215 ms 162172 KB Output is correct
29 Correct 200 ms 162264 KB Output is correct
30 Correct 218 ms 162260 KB Output is correct
31 Correct 242 ms 162280 KB Output is correct
32 Correct 203 ms 162260 KB Output is correct
33 Correct 202 ms 162232 KB Output is correct
34 Correct 168 ms 161972 KB Output is correct
35 Correct 164 ms 161856 KB Output is correct
36 Correct 162 ms 161752 KB Output is correct
37 Correct 170 ms 161716 KB Output is correct
38 Correct 161 ms 161972 KB Output is correct
39 Correct 185 ms 160840 KB Output is correct
40 Correct 134 ms 148464 KB Output is correct
41 Correct 191 ms 160488 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 125532 KB Output is correct
2 Correct 18 ms 125492 KB Output is correct
3 Correct 18 ms 125528 KB Output is correct
4 Correct 18 ms 125676 KB Output is correct
5 Correct 20 ms 125532 KB Output is correct
6 Correct 20 ms 125532 KB Output is correct
7 Correct 18 ms 125580 KB Output is correct
8 Correct 19 ms 125532 KB Output is correct
9 Correct 18 ms 125528 KB Output is correct
10 Correct 19 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 22 ms 126296 KB Output is correct
15 Correct 21 ms 126300 KB Output is correct
16 Correct 21 ms 126300 KB Output is correct
17 Correct 20 ms 126044 KB Output is correct
18 Correct 22 ms 126300 KB Output is correct
19 Runtime error 311 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -