oj.uz

답안 #1057874

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057874 2024-08-14T07:01:18 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
0 / 100
 415 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, bool merge_vx)
{
    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 (!merge_vx) return c;
    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;
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],1);
}
node get(ll id, ll l, ll r, ll u, ll v)
{
    if (u <= l && r <= v) return st[id];
    ll m = (r+l)>>1;
    if (v <= m) return get(id<<1,l,m,u,v);
    else if (m+1 <= u) return get(id<<1|1,m+1,r,u,v);
    else return merge(get(id<<1,l,m,u,v), get(id<<1|1,m+1,r,u,v),0);
}
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;
        cout << (get(1,1,n,l,r).ans <= k) << '\n';
    }
}

Compilation message

sortbooks.cpp: In function 'node merge(node, node, bool)':
sortbooks.cpp:24:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     while (id_a < a.v.size() && id_b < b.v.size())
      |            ~~~~~^~~~~~~~~~~~
sortbooks.cpp:24:38: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     while (id_a < a.v.size() && id_b < b.v.size())
      |                                 ~~~~~^~~~~~~~~~~~
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_a < a.v.size()) c.v.pb(a.v[id_a++]);
      |            ~~~~~^~~~~~~~~~~~
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_b < b.v.size()) c.v.pb(b.v[id_b++]);
      |            ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 125532 KB Output is correct
2 Correct 19 ms 125528 KB Output is correct
3 Incorrect 18 ms 125532 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 125532 KB Output is correct
2 Correct 19 ms 125528 KB Output is correct
3 Incorrect 18 ms 125532 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 415 ms 142892 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 125532 KB Output is correct
2 Correct 19 ms 125528 KB Output is correct
3 Incorrect 18 ms 125532 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 125532 KB Output is correct
2 Correct 19 ms 125528 KB Output is correct
3 Incorrect 18 ms 125532 KB Output isn't correct
4 Halted 0 ms 0 KB -