oj.uz

Submission #153466

# Submission time Handle Problem Language Result Execution time Memory
153466 2019-09-14T08:33:50 Z leatherman Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 3000 ms 110416 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#define ll int
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define sqr(x) (x)*(x)
#define PB push_back

using namespace std;
typedef long double ld;
const ll N = 1123456;
mt19937_64 rnd(chrono::system_clock::now().time_since_epoch().count());
vector<pair<ll, ll> > v;
vector<ll> of[N],q[N],pisos
;
pair<ll, ll> b[N];
ll ans[N],t[4 * N],a[N],l,r,x,k,limit,n,Q;
void upd(ll v,ll tl,ll tr,ll pos,ll val)
{
    if(tl == tr)
    {
        t[v] = max(t[v], val);
        return;
    }
    ll tm = (tl + tr) / 2;
    if(pos <= tm) upd(2 * v, tl, tm, pos, val);
    else upd(2 * v + 1, tm + 1, tr, pos, val);
    t[v] = max(t[2 * v], t[2 * v + 1]);
}
ll get(ll v,ll tl,ll tr,ll l,ll r)
{
    if(l > r) return 0;
    if(tl == l && tr == r) return t[v];
    ll tm = (tl + tr) / 2;
    return max(get(2 * v, tl, tm, l, min(r, tm)), get(2 * v + 1, tm + 1, tr, max(l, tm + 1), r));
}
int main()
{
    ios_base::sync_with_stdio();cin.tie(0);cout.tie(0);
    cin>>n>>Q;
    for(int i = 1; i <= n; i++) cin>>a[i];
    for(int i = n; i >= 1; i--)
    {
        x  = a[i];
        while(!v.empty() && x > v.back().fi)
        {
            of[i].PB(v.back().se);
            v.pop_back();
        }
        v.PB({x, i});
    }
    for(int i = 1; i <= Q; i++)
    {
        cin>>l>>r>>k;
        b[i] = {r, k};
        q[l].PB(i);
        pisos.PB(l);
    }
    limit = n;
    sort(all(pisos));
    pisos.erase(unique(all(pisos)), pisos.end());
    reverse(all(pisos));
    for(auto l : pisos)
        for(auto i : q[l])
    {
        r = b[i].fi;
        while(limit >= l)
        {
            for(auto j : of[limit]) upd(1, 1, n, j, a[j] + a[limit]);
            limit--;
        }
        x = get(1, 1, n, l, r);
//        cout<<l<<" "<<r<<" = "<<x<<endl;
        ans[i] = (x <= b[i].se);
    }
    for(int i = 1; i <= Q; i++) cout<<ans[i]<<endl;
    return 0;
}
/*
8 6
5 4 3 1 6 7 8 2
1 5 0
2 5 0
3 5 0
4 5 0
5 5 0
1 8 0
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 53112 KB Output is correct
2 Correct 49 ms 53112 KB Output is correct
3 Correct 52 ms 53096 KB Output is correct
4 Correct 50 ms 53112 KB Output is correct
5 Correct 50 ms 53112 KB Output is correct
6 Correct 53 ms 53112 KB Output is correct
7 Correct 52 ms 53112 KB Output is correct
8 Correct 52 ms 53240 KB Output is correct
9 Correct 52 ms 53112 KB Output is correct
10 Correct 51 ms 53112 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 53112 KB Output is correct
2 Correct 49 ms 53112 KB Output is correct
3 Correct 52 ms 53096 KB Output is correct
4 Correct 50 ms 53112 KB Output is correct
5 Correct 50 ms 53112 KB Output is correct
6 Correct 53 ms 53112 KB Output is correct
7 Correct 52 ms 53112 KB Output is correct
8 Correct 52 ms 53240 KB Output is correct
9 Correct 52 ms 53112 KB Output is correct
10 Correct 51 ms 53112 KB Output is correct
11 Correct 67 ms 53296 KB Output is correct
12 Correct 71 ms 53328 KB Output is correct
13 Correct 69 ms 53568 KB Output is correct
14 Correct 78 ms 53576 KB Output is correct
15 Correct 77 ms 53468 KB Output is correct
16 Correct 74 ms 53368 KB Output is correct
17 Correct 72 ms 53320 KB Output is correct
18 Correct 71 ms 53368 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3049 ms 110416 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 579 ms 59980 KB Output is correct
2 Correct 548 ms 59040 KB Output is correct
3 Correct 554 ms 57864 KB Output is correct
4 Correct 561 ms 58016 KB Output is correct
5 Correct 559 ms 58264 KB Output is correct
6 Correct 510 ms 57016 KB Output is correct
7 Correct 536 ms 56916 KB Output is correct
8 Correct 521 ms 58092 KB Output is correct
9 Correct 444 ms 55636 KB Output is correct
10 Correct 517 ms 57980 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 53112 KB Output is correct
2 Correct 49 ms 53112 KB Output is correct
3 Correct 52 ms 53096 KB Output is correct
4 Correct 50 ms 53112 KB Output is correct
5 Correct 50 ms 53112 KB Output is correct
6 Correct 53 ms 53112 KB Output is correct
7 Correct 52 ms 53112 KB Output is correct
8 Correct 52 ms 53240 KB Output is correct
9 Correct 52 ms 53112 KB Output is correct
10 Correct 51 ms 53112 KB Output is correct
11 Correct 67 ms 53296 KB Output is correct
12 Correct 71 ms 53328 KB Output is correct
13 Correct 69 ms 53568 KB Output is correct
14 Correct 78 ms 53576 KB Output is correct
15 Correct 77 ms 53468 KB Output is correct
16 Correct 74 ms 53368 KB Output is correct
17 Correct 72 ms 53320 KB Output is correct
18 Correct 71 ms 53368 KB Output is correct
19 Correct 1342 ms 67020 KB Output is correct
20 Correct 1310 ms 66740 KB Output is correct
21 Correct 1238 ms 64364 KB Output is correct
22 Correct 1211 ms 64588 KB Output is correct
23 Correct 1216 ms 64520 KB Output is correct
24 Correct 1160 ms 60712 KB Output is correct
25 Correct 1173 ms 60776 KB Output is correct
26 Correct 1218 ms 61752 KB Output is correct
27 Correct 1217 ms 61576 KB Output is correct
28 Correct 1212 ms 61860 KB Output is correct
29 Correct 1242 ms 63072 KB Output is correct
30 Correct 1232 ms 63048 KB Output is correct
31 Correct 1240 ms 62956 KB Output is correct
32 Correct 1230 ms 62980 KB Output is correct
33 Correct 1232 ms 63056 KB Output is correct
34 Correct 1131 ms 60744 KB Output is correct
35 Correct 1127 ms 60544 KB Output is correct
36 Correct 1127 ms 60740 KB Output is correct
37 Correct 1113 ms 60532 KB Output is correct
38 Correct 1123 ms 60624 KB Output is correct
39 Correct 1144 ms 62964 KB Output is correct
40 Correct 1043 ms 61036 KB Output is correct
41 Correct 1128 ms 62724 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 53112 KB Output is correct
2 Correct 49 ms 53112 KB Output is correct
3 Correct 52 ms 53096 KB Output is correct
4 Correct 50 ms 53112 KB Output is correct
5 Correct 50 ms 53112 KB Output is correct
6 Correct 53 ms 53112 KB Output is correct
7 Correct 52 ms 53112 KB Output is correct
8 Correct 52 ms 53240 KB Output is correct
9 Correct 52 ms 53112 KB Output is correct
10 Correct 51 ms 53112 KB Output is correct
11 Correct 67 ms 53296 KB Output is correct
12 Correct 71 ms 53328 KB Output is correct
13 Correct 69 ms 53568 KB Output is correct
14 Correct 78 ms 53576 KB Output is correct
15 Correct 77 ms 53468 KB Output is correct
16 Correct 74 ms 53368 KB Output is correct
17 Correct 72 ms 53320 KB Output is correct
18 Correct 71 ms 53368 KB Output is correct
19 Execution timed out 3049 ms 110416 KB Time limit exceeded
20 Halted 0 ms 0 KB -