oj.uz

Submission #153465

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

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

#define ll long long
#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 MOD = 1e9 + 7;
const ll N = 1e6 + 200;
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 45 ms 47352 KB Output is correct
2 Correct 44 ms 47356 KB Output is correct
3 Correct 46 ms 47352 KB Output is correct
4 Correct 46 ms 47352 KB Output is correct
5 Correct 45 ms 47352 KB Output is correct
6 Correct 46 ms 47352 KB Output is correct
7 Correct 47 ms 47352 KB Output is correct
8 Correct 46 ms 47352 KB Output is correct
9 Correct 46 ms 47352 KB Output is correct
10 Correct 46 ms 47352 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 47352 KB Output is correct
2 Correct 44 ms 47356 KB Output is correct
3 Correct 46 ms 47352 KB Output is correct
4 Correct 46 ms 47352 KB Output is correct
5 Correct 45 ms 47352 KB Output is correct
6 Correct 46 ms 47352 KB Output is correct
7 Correct 47 ms 47352 KB Output is correct
8 Correct 46 ms 47352 KB Output is correct
9 Correct 46 ms 47352 KB Output is correct
10 Correct 46 ms 47352 KB Output is correct
11 Correct 59 ms 47508 KB Output is correct
12 Correct 61 ms 47736 KB Output is correct
13 Correct 63 ms 47708 KB Output is correct
14 Correct 73 ms 47864 KB Output is correct
15 Correct 72 ms 47920 KB Output is correct
16 Correct 68 ms 47836 KB Output is correct
17 Correct 69 ms 47724 KB Output is correct
18 Correct 66 ms 47864 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 576 ms 57608 KB Output is correct
2 Correct 558 ms 56976 KB Output is correct
3 Correct 570 ms 55216 KB Output is correct
4 Correct 557 ms 55140 KB Output is correct
5 Correct 565 ms 55172 KB Output is correct
6 Correct 515 ms 54712 KB Output is correct
7 Correct 517 ms 54600 KB Output is correct
8 Correct 525 ms 56332 KB Output is correct
9 Correct 442 ms 51828 KB Output is correct
10 Correct 529 ms 56044 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 47352 KB Output is correct
2 Correct 44 ms 47356 KB Output is correct
3 Correct 46 ms 47352 KB Output is correct
4 Correct 46 ms 47352 KB Output is correct
5 Correct 45 ms 47352 KB Output is correct
6 Correct 46 ms 47352 KB Output is correct
7 Correct 47 ms 47352 KB Output is correct
8 Correct 46 ms 47352 KB Output is correct
9 Correct 46 ms 47352 KB Output is correct
10 Correct 46 ms 47352 KB Output is correct
11 Correct 59 ms 47508 KB Output is correct
12 Correct 61 ms 47736 KB Output is correct
13 Correct 63 ms 47708 KB Output is correct
14 Correct 73 ms 47864 KB Output is correct
15 Correct 72 ms 47920 KB Output is correct
16 Correct 68 ms 47836 KB Output is correct
17 Correct 69 ms 47724 KB Output is correct
18 Correct 66 ms 47864 KB Output is correct
19 Correct 1338 ms 67892 KB Output is correct
20 Correct 1305 ms 67780 KB Output is correct
21 Correct 1255 ms 66324 KB Output is correct
22 Correct 1242 ms 66376 KB Output is correct
23 Correct 1237 ms 66356 KB Output is correct
24 Correct 1183 ms 61620 KB Output is correct
25 Correct 1201 ms 61700 KB Output is correct
26 Correct 1258 ms 62264 KB Output is correct
27 Correct 1234 ms 62368 KB Output is correct
28 Correct 1232 ms 62320 KB Output is correct
29 Correct 1251 ms 63192 KB Output is correct
30 Correct 1250 ms 63164 KB Output is correct
31 Correct 1255 ms 63108 KB Output is correct
32 Correct 1247 ms 63140 KB Output is correct
33 Correct 1283 ms 63112 KB Output is correct
34 Correct 1148 ms 61820 KB Output is correct
35 Correct 1139 ms 61760 KB Output is correct
36 Correct 1136 ms 61932 KB Output is correct
37 Correct 1147 ms 61828 KB Output is correct
38 Correct 1158 ms 61576 KB Output is correct
39 Correct 1140 ms 64296 KB Output is correct
40 Correct 1065 ms 61388 KB Output is correct
41 Correct 1097 ms 64284 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 47352 KB Output is correct
2 Correct 44 ms 47356 KB Output is correct
3 Correct 46 ms 47352 KB Output is correct
4 Correct 46 ms 47352 KB Output is correct
5 Correct 45 ms 47352 KB Output is correct
6 Correct 46 ms 47352 KB Output is correct
7 Correct 47 ms 47352 KB Output is correct
8 Correct 46 ms 47352 KB Output is correct
9 Correct 46 ms 47352 KB Output is correct
10 Correct 46 ms 47352 KB Output is correct
11 Correct 59 ms 47508 KB Output is correct
12 Correct 61 ms 47736 KB Output is correct
13 Correct 63 ms 47708 KB Output is correct
14 Correct 73 ms 47864 KB Output is correct
15 Correct 72 ms 47920 KB Output is correct
16 Correct 68 ms 47836 KB Output is correct
17 Correct 69 ms 47724 KB Output is correct
18 Correct 66 ms 47864 KB Output is correct
19 Execution timed out 3019 ms 130468 KB Time limit exceeded
20 Halted 0 ms 0 KB -