oj.uz

답안 #1057910

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057910 2024-08-14T07:16:55 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 333 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]) 
        {
            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++;
    }
    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: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_a < a.v.size())
      |            ~~~~~^~~~~~~~~~~~
sortbooks.cpp:40:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     while (id_b < b.v.size())
      |            ~~~~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 125704 KB Output is correct
2 Correct 19 ms 125532 KB Output is correct
3 Correct 19 ms 125532 KB Output is correct
4 Correct 21 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 125672 KB Output is correct
8 Correct 20 ms 125532 KB Output is correct
9 Correct 19 ms 125532 KB Output is correct
10 Correct 19 ms 125596 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 125704 KB Output is correct
2 Correct 19 ms 125532 KB Output is correct
3 Correct 19 ms 125532 KB Output is correct
4 Correct 21 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 125672 KB Output is correct
8 Correct 20 ms 125532 KB Output is correct
9 Correct 19 ms 125532 KB Output is correct
10 Correct 19 ms 125596 KB Output is correct
11 Correct 20 ms 125656 KB Output is correct
12 Correct 24 ms 126360 KB Output is correct
13 Correct 26 ms 126300 KB Output is correct
14 Correct 23 ms 126300 KB Output is correct
15 Correct 27 ms 126296 KB Output is correct
16 Correct 22 ms 126300 KB Output is correct
17 Correct 21 ms 126044 KB Output is correct
18 Correct 21 ms 125856 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 138320 KB Output is correct
2 Correct 123 ms 138320 KB Output is correct
3 Correct 85 ms 134228 KB Output is correct
4 Correct 90 ms 134320 KB Output is correct
5 Correct 91 ms 134228 KB Output is correct
6 Correct 67 ms 134396 KB Output is correct
7 Correct 71 ms 134376 KB Output is correct
8 Correct 83 ms 134336 KB Output is correct
9 Correct 41 ms 125876 KB Output is correct
10 Correct 77 ms 134360 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 125704 KB Output is correct
2 Correct 19 ms 125532 KB Output is correct
3 Correct 19 ms 125532 KB Output is correct
4 Correct 21 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 125672 KB Output is correct
8 Correct 20 ms 125532 KB Output is correct
9 Correct 19 ms 125532 KB Output is correct
10 Correct 19 ms 125596 KB Output is correct
11 Correct 20 ms 125656 KB Output is correct
12 Correct 24 ms 126360 KB Output is correct
13 Correct 26 ms 126300 KB Output is correct
14 Correct 23 ms 126300 KB Output is correct
15 Correct 27 ms 126296 KB Output is correct
16 Correct 22 ms 126300 KB Output is correct
17 Correct 21 ms 126044 KB Output is correct
18 Correct 21 ms 125856 KB Output is correct
19 Correct 304 ms 156396 KB Output is correct
20 Correct 265 ms 156428 KB Output is correct
21 Correct 218 ms 156256 KB Output is correct
22 Correct 219 ms 156396 KB Output is correct
23 Correct 228 ms 156264 KB Output is correct
24 Correct 175 ms 156408 KB Output is correct
25 Correct 183 ms 156288 KB Output is correct
26 Correct 225 ms 156292 KB Output is correct
27 Correct 203 ms 156404 KB Output is correct
28 Correct 227 ms 156384 KB Output is correct
29 Correct 244 ms 156252 KB Output is correct
30 Correct 226 ms 156256 KB Output is correct
31 Correct 266 ms 156292 KB Output is correct
32 Correct 232 ms 156416 KB Output is correct
33 Correct 218 ms 156292 KB Output is correct
34 Correct 194 ms 156360 KB Output is correct
35 Correct 164 ms 156396 KB Output is correct
36 Correct 164 ms 156396 KB Output is correct
37 Correct 165 ms 156292 KB Output is correct
38 Correct 168 ms 156260 KB Output is correct
39 Correct 215 ms 156428 KB Output is correct
40 Correct 173 ms 144196 KB Output is correct
41 Correct 156 ms 140628 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 125704 KB Output is correct
2 Correct 19 ms 125532 KB Output is correct
3 Correct 19 ms 125532 KB Output is correct
4 Correct 21 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 125672 KB Output is correct
8 Correct 20 ms 125532 KB Output is correct
9 Correct 19 ms 125532 KB Output is correct
10 Correct 19 ms 125596 KB Output is correct
11 Correct 20 ms 125656 KB Output is correct
12 Correct 24 ms 126360 KB Output is correct
13 Correct 26 ms 126300 KB Output is correct
14 Correct 23 ms 126300 KB Output is correct
15 Correct 27 ms 126296 KB Output is correct
16 Correct 22 ms 126300 KB Output is correct
17 Correct 21 ms 126044 KB Output is correct
18 Correct 21 ms 125856 KB Output is correct
19 Runtime error 333 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -