oj.uz

Submission #151670

# Submission time Handle Problem Language Result Execution time Memory
151670 2019-09-04T05:19:18 Z leatherman Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 3000 ms 54968 KB 
#include <bits/stdc++.h>

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

#define fi first
#define se second
#define p_b push_back
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define all(x) x.begin(),x.end()
#define sqr(x) (x)*(x)
#define pw(x) (1ll << x)

using namespace std;
typedef long double ld;
const int MAXN = 1123456;
const int N = 1e6 + 200;
mt19937_64 rnd(chrono::system_clock::now().time_since_epoch().count());

template <typename T> void vout(T s){cout << s << endl;exit(0);}
vector<pair<int, int> > v;
pair<pair<int, int>, int> b[N];
vector<int> q;
int t[4 * N],a[N],n,Q,limit,l,r,x,k,ans[N];
int pos, val;
void upd(int v,int tl,int tr)
{
    if(tl == tr)
    {
        t[v] = val + a[tl];
        return;
    }
    int tm = (tl + tr) >> 1;
    if(pos <= tm) upd(v << 1, tl, tm);
    else upd(v << 1 | 1, tm + 1, tr);
    t[v] = max(t[v << 1], t[v << 1 | 1]);
}
int get(int v,int tl,int tr,int l,int r)
{
    if(l > r) return 0;
    if(tl == l && tr == r) return t[v];
    int tm = (tl + tr) >> 1;
    return max(get(v << 1, tl, tm, l, min(r, tm)), get(v << 1 | 1, tm + 1, tr, max(l, tm + 1), r));
}
void make(int l,int r)
{
    for(int i = r; i >= l; i--)
    {
        int x = a[i],Pos;
        while(!v.empty() && x > v.back().fi)
        {
            Pos = v.back().se;
            pos = Pos;
            val = x;
            upd(1, 1, n);
            v.pop_back();
        }
        v.push_back({x, i});
    }
}
bool comp(int i,int j)
{
    return (b[i].fi.fi > b[j].fi.fi) || (b[i].fi.fi == b[j].fi.fi && (m_p(b[i].fi.se, b[i].se) < m_p(b[j].fi.se, b[j].se)));
}
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];
    limit = n;
    for(int i = 1; i <= Q; i++)
    {
        cin>>l>>r>>x;
        b[i] = {{l, r}, x};
        q.push_back(i);
    }
    sort(all(q), comp);
    for(auto i : q)
    {
        l = b[i].fi.fi;
        r = b[i].fi.se;
        k = b[i].se;
        if(limit >= l)
        {
            make(l, limit);
            limit = l - 1;
        }
        x = get(1, 1, n, l, r);
        ans[i] = (x <= k);
    }
    for(int i = 1; i <= Q; i++) cout<<ans[i]<<"\n";
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 9 ms 504 KB Output is correct
12 Correct 11 ms 632 KB Output is correct
13 Correct 12 ms 636 KB Output is correct
14 Correct 16 ms 732 KB Output is correct
15 Correct 16 ms 760 KB Output is correct
16 Correct 13 ms 760 KB Output is correct
17 Correct 12 ms 632 KB Output is correct
18 Correct 12 ms 636 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 6036 KB Output is correct
2 Correct 232 ms 5996 KB Output is correct
3 Correct 228 ms 5948 KB Output is correct
4 Correct 232 ms 5904 KB Output is correct
5 Correct 230 ms 5872 KB Output is correct
6 Correct 224 ms 5736 KB Output is correct
7 Correct 216 ms 5740 KB Output is correct
8 Correct 207 ms 5820 KB Output is correct
9 Correct 154 ms 3976 KB Output is correct
10 Correct 212 ms 5692 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 9 ms 504 KB Output is correct
12 Correct 11 ms 632 KB Output is correct
13 Correct 12 ms 636 KB Output is correct
14 Correct 16 ms 732 KB Output is correct
15 Correct 16 ms 760 KB Output is correct
16 Correct 13 ms 760 KB Output is correct
17 Correct 12 ms 632 KB Output is correct
18 Correct 12 ms 636 KB Output is correct
19 Correct 655 ms 14444 KB Output is correct
20 Correct 654 ms 14360 KB Output is correct
21 Correct 626 ms 14260 KB Output is correct
22 Correct 643 ms 14068 KB Output is correct
23 Correct 640 ms 14060 KB Output is correct
24 Correct 603 ms 13524 KB Output is correct
25 Correct 637 ms 13540 KB Output is correct
26 Correct 631 ms 13692 KB Output is correct
27 Correct 616 ms 13836 KB Output is correct
28 Correct 627 ms 14024 KB Output is correct
29 Correct 635 ms 14068 KB Output is correct
30 Correct 654 ms 13916 KB Output is correct
31 Correct 663 ms 13892 KB Output is correct
32 Correct 623 ms 13952 KB Output is correct
33 Correct 624 ms 13832 KB Output is correct
34 Correct 594 ms 13572 KB Output is correct
35 Correct 586 ms 13540 KB Output is correct
36 Correct 587 ms 13400 KB Output is correct
37 Correct 594 ms 13400 KB Output is correct
38 Correct 603 ms 13484 KB Output is correct
39 Correct 538 ms 13164 KB Output is correct
40 Correct 455 ms 11244 KB Output is correct
41 Correct 499 ms 12260 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 9 ms 504 KB Output is correct
12 Correct 11 ms 632 KB Output is correct
13 Correct 12 ms 636 KB Output is correct
14 Correct 16 ms 732 KB Output is correct
15 Correct 16 ms 760 KB Output is correct
16 Correct 13 ms 760 KB Output is correct
17 Correct 12 ms 632 KB Output is correct
18 Correct 12 ms 636 KB Output is correct
19 Execution timed out 3099 ms 54968 KB Time limit exceeded
20 Halted 0 ms 0 KB -