oj.uz

답안 #1057924

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057924 2024-08-14T07:21:53 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 384 ms 262148 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];
    ll pw = (1LL<<(__lg(n-1)+1));
    build(1,1,pw);
    while (q--)
    {
        ll l, r, k; cin >> l >> r >> k; ans = 0; f = -mod; get(1,1,pw,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 125532 KB Output is correct
2 Correct 18 ms 125532 KB Output is correct
3 Correct 18 ms 125532 KB Output is correct
4 Correct 19 ms 125496 KB Output is correct
5 Correct 19 ms 125528 KB Output is correct
6 Correct 19 ms 125532 KB Output is correct
7 Correct 19 ms 125532 KB Output is correct
8 Correct 20 ms 125532 KB Output is correct
9 Correct 18 ms 125532 KB Output is correct
10 Correct 21 ms 125532 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 125532 KB Output is correct
2 Correct 18 ms 125532 KB Output is correct
3 Correct 18 ms 125532 KB Output is correct
4 Correct 19 ms 125496 KB Output is correct
5 Correct 19 ms 125528 KB Output is correct
6 Correct 19 ms 125532 KB Output is correct
7 Correct 19 ms 125532 KB Output is correct
8 Correct 20 ms 125532 KB Output is correct
9 Correct 18 ms 125532 KB Output is correct
10 Correct 21 ms 125532 KB Output is correct
11 Correct 20 ms 125788 KB Output is correct
12 Correct 21 ms 126292 KB Output is correct
13 Correct 21 ms 126300 KB Output is correct
14 Correct 22 ms 126300 KB Output is correct
15 Correct 22 ms 126440 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 126044 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 139360 KB Output is correct
2 Correct 98 ms 139388 KB Output is correct
3 Correct 79 ms 136276 KB Output is correct
4 Correct 82 ms 136276 KB Output is correct
5 Correct 80 ms 136276 KB Output is correct
6 Correct 65 ms 136272 KB Output is correct
7 Correct 68 ms 136276 KB Output is correct
8 Correct 72 ms 136272 KB Output is correct
9 Correct 38 ms 125788 KB Output is correct
10 Correct 73 ms 136276 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 125532 KB Output is correct
2 Correct 18 ms 125532 KB Output is correct
3 Correct 18 ms 125532 KB Output is correct
4 Correct 19 ms 125496 KB Output is correct
5 Correct 19 ms 125528 KB Output is correct
6 Correct 19 ms 125532 KB Output is correct
7 Correct 19 ms 125532 KB Output is correct
8 Correct 20 ms 125532 KB Output is correct
9 Correct 18 ms 125532 KB Output is correct
10 Correct 21 ms 125532 KB Output is correct
11 Correct 20 ms 125788 KB Output is correct
12 Correct 21 ms 126292 KB Output is correct
13 Correct 21 ms 126300 KB Output is correct
14 Correct 22 ms 126300 KB Output is correct
15 Correct 22 ms 126440 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 126044 KB Output is correct
19 Correct 300 ms 157156 KB Output is correct
20 Correct 242 ms 157264 KB Output is correct
21 Correct 215 ms 157148 KB Output is correct
22 Correct 217 ms 157152 KB Output is correct
23 Correct 218 ms 157152 KB Output is correct
24 Correct 173 ms 157156 KB Output is correct
25 Correct 191 ms 157092 KB Output is correct
26 Correct 190 ms 157116 KB Output is correct
27 Correct 195 ms 157160 KB Output is correct
28 Correct 211 ms 157160 KB Output is correct
29 Correct 235 ms 157144 KB Output is correct
30 Correct 203 ms 157140 KB Output is correct
31 Correct 222 ms 157160 KB Output is correct
32 Correct 219 ms 157164 KB Output is correct
33 Correct 214 ms 157164 KB Output is correct
34 Correct 165 ms 157140 KB Output is correct
35 Correct 161 ms 157160 KB Output is correct
36 Correct 165 ms 157180 KB Output is correct
37 Correct 180 ms 157160 KB Output is correct
38 Correct 169 ms 157268 KB Output is correct
39 Correct 192 ms 157148 KB Output is correct
40 Correct 122 ms 144076 KB Output is correct
41 Correct 138 ms 144684 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 125532 KB Output is correct
2 Correct 18 ms 125532 KB Output is correct
3 Correct 18 ms 125532 KB Output is correct
4 Correct 19 ms 125496 KB Output is correct
5 Correct 19 ms 125528 KB Output is correct
6 Correct 19 ms 125532 KB Output is correct
7 Correct 19 ms 125532 KB Output is correct
8 Correct 20 ms 125532 KB Output is correct
9 Correct 18 ms 125532 KB Output is correct
10 Correct 21 ms 125532 KB Output is correct
11 Correct 20 ms 125788 KB Output is correct
12 Correct 21 ms 126292 KB Output is correct
13 Correct 21 ms 126300 KB Output is correct
14 Correct 22 ms 126300 KB Output is correct
15 Correct 22 ms 126440 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 126044 KB Output is correct
19 Runtime error 384 ms 262148 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -