oj.uz

Submission #153573

# Submission time Handle Problem Language Result Execution time Memory
153573 2019-09-14T16:23:43 Z leatherman Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 3000 ms 118864 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)
    {
        while(limit >= l)
        {
            for(auto j : of[limit]) upd(1, 1, n, j, a[j] + a[limit]);
            of[limit].clear();
            limit--;
        }
        for(auto i : q[l])
        {
            r = b[i].fi;
            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;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 53112 KB Output is correct
2 Correct 52 ms 53112 KB Output is correct
3 Correct 54 ms 53112 KB Output is correct
4 Correct 54 ms 53112 KB Output is correct
5 Correct 53 ms 53084 KB Output is correct
6 Correct 54 ms 53240 KB Output is correct
7 Correct 55 ms 53240 KB Output is correct
8 Correct 54 ms 53164 KB Output is correct
9 Correct 55 ms 53156 KB Output is correct
10 Correct 61 ms 53112 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 53112 KB Output is correct
2 Correct 52 ms 53112 KB Output is correct
3 Correct 54 ms 53112 KB Output is correct
4 Correct 54 ms 53112 KB Output is correct
5 Correct 53 ms 53084 KB Output is correct
6 Correct 54 ms 53240 KB Output is correct
7 Correct 55 ms 53240 KB Output is correct
8 Correct 54 ms 53164 KB Output is correct
9 Correct 55 ms 53156 KB Output is correct
10 Correct 61 ms 53112 KB Output is correct
11 Correct 67 ms 53288 KB Output is correct
12 Correct 69 ms 53496 KB Output is correct
13 Correct 70 ms 53496 KB Output is correct
14 Correct 80 ms 53740 KB Output is correct
15 Correct 79 ms 53624 KB Output is correct
16 Correct 76 ms 53496 KB Output is correct
17 Correct 74 ms 53496 KB Output is correct
18 Correct 74 ms 53496 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3024 ms 118864 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 59960 KB Output is correct
2 Correct 553 ms 60960 KB Output is correct
3 Correct 557 ms 59748 KB Output is correct
4 Correct 567 ms 59980 KB Output is correct
5 Correct 582 ms 60252 KB Output is correct
6 Correct 504 ms 58760 KB Output is correct
7 Correct 509 ms 58788 KB Output is correct
8 Correct 526 ms 59884 KB Output is correct
9 Correct 446 ms 56884 KB Output is correct
10 Correct 526 ms 59632 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 53112 KB Output is correct
2 Correct 52 ms 53112 KB Output is correct
3 Correct 54 ms 53112 KB Output is correct
4 Correct 54 ms 53112 KB Output is correct
5 Correct 53 ms 53084 KB Output is correct
6 Correct 54 ms 53240 KB Output is correct
7 Correct 55 ms 53240 KB Output is correct
8 Correct 54 ms 53164 KB Output is correct
9 Correct 55 ms 53156 KB Output is correct
10 Correct 61 ms 53112 KB Output is correct
11 Correct 67 ms 53288 KB Output is correct
12 Correct 69 ms 53496 KB Output is correct
13 Correct 70 ms 53496 KB Output is correct
14 Correct 80 ms 53740 KB Output is correct
15 Correct 79 ms 53624 KB Output is correct
16 Correct 76 ms 53496 KB Output is correct
17 Correct 74 ms 53496 KB Output is correct
18 Correct 74 ms 53496 KB Output is correct
19 Correct 1346 ms 73408 KB Output is correct
20 Correct 1304 ms 73328 KB Output is correct
21 Correct 1228 ms 70888 KB Output is correct
22 Correct 1228 ms 70832 KB Output is correct
23 Correct 1223 ms 70988 KB Output is correct
24 Correct 1158 ms 67136 KB Output is correct
25 Correct 1158 ms 67084 KB Output is correct
26 Correct 1220 ms 68076 KB Output is correct
27 Correct 1205 ms 68056 KB Output is correct
28 Correct 1231 ms 68480 KB Output is correct
29 Correct 1262 ms 69712 KB Output is correct
30 Correct 1246 ms 69708 KB Output is correct
31 Correct 1257 ms 69552 KB Output is correct
32 Correct 1246 ms 69536 KB Output is correct
33 Correct 1251 ms 69556 KB Output is correct
34 Correct 1131 ms 66812 KB Output is correct
35 Correct 1120 ms 66720 KB Output is correct
36 Correct 1127 ms 66704 KB Output is correct
37 Correct 1113 ms 66636 KB Output is correct
38 Correct 1131 ms 66956 KB Output is correct
39 Correct 1120 ms 68232 KB Output is correct
40 Correct 1027 ms 65548 KB Output is correct
41 Correct 1117 ms 67448 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 53112 KB Output is correct
2 Correct 52 ms 53112 KB Output is correct
3 Correct 54 ms 53112 KB Output is correct
4 Correct 54 ms 53112 KB Output is correct
5 Correct 53 ms 53084 KB Output is correct
6 Correct 54 ms 53240 KB Output is correct
7 Correct 55 ms 53240 KB Output is correct
8 Correct 54 ms 53164 KB Output is correct
9 Correct 55 ms 53156 KB Output is correct
10 Correct 61 ms 53112 KB Output is correct
11 Correct 67 ms 53288 KB Output is correct
12 Correct 69 ms 53496 KB Output is correct
13 Correct 70 ms 53496 KB Output is correct
14 Correct 80 ms 53740 KB Output is correct
15 Correct 79 ms 53624 KB Output is correct
16 Correct 76 ms 53496 KB Output is correct
17 Correct 74 ms 53496 KB Output is correct
18 Correct 74 ms 53496 KB Output is correct
19 Execution timed out 3024 ms 118864 KB Time limit exceeded
20 Halted 0 ms 0 KB -