oj.uz

Submission #151671

# Submission time Handle Problem Language Result Execution time Memory
151671 2019-09-04T05:27:53 Z leatherman Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 3000 ms 29756 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];
int t[4 * N],a[N],n,Q,limit,l,r,x,ans[N],q[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)
{
    if(tr < l || tl > r) return 0;
    if(tl >= l && tr <= r) return t[v];
    int tm = (tl + tr) >> 1;
    return max(get(v << 1, tl, tm), get(v << 1 | 1, tm + 1, tr));
}
void make(int l,int r)
{
    int x,Pos;
    for(int i = r; i >= l; i--)
    {
        x = a[i];
        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[i] = i;
    }
    sort(q + 1, q + Q + 1, comp);
    for(int i,j = 1; j <= Q; j++)
    {
        i = q[j];
        l = b[i].fi.fi;
        r = b[i].fi.se;
        if(limit >= l)
        {
            make(l, limit);
            limit = l - 1;
        }
        x = get(1, 1, n);
        ans[i] = (x <= b[i].se);
    }
    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 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 3 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 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 3 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 632 KB Output is correct
14 Correct 16 ms 632 KB Output is correct
15 Correct 16 ms 676 KB Output is correct
16 Correct 13 ms 632 KB Output is correct
17 Correct 12 ms 636 KB Output is correct
18 Correct 11 ms 696 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 238 ms 4444 KB Output is correct
2 Correct 234 ms 4472 KB Output is correct
3 Correct 231 ms 4500 KB Output is correct
4 Correct 230 ms 4436 KB Output is correct
5 Correct 233 ms 4388 KB Output is correct
6 Correct 221 ms 4432 KB Output is correct
7 Correct 218 ms 4384 KB Output is correct
8 Correct 201 ms 4720 KB Output is correct
9 Correct 150 ms 3072 KB Output is correct
10 Correct 202 ms 4624 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 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 3 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 632 KB Output is correct
14 Correct 16 ms 632 KB Output is correct
15 Correct 16 ms 676 KB Output is correct
16 Correct 13 ms 632 KB Output is correct
17 Correct 12 ms 636 KB Output is correct
18 Correct 11 ms 696 KB Output is correct
19 Correct 655 ms 8060 KB Output is correct
20 Correct 654 ms 8128 KB Output is correct
21 Correct 631 ms 8140 KB Output is correct
22 Correct 636 ms 8116 KB Output is correct
23 Correct 651 ms 7964 KB Output is correct
24 Correct 623 ms 7696 KB Output is correct
25 Correct 605 ms 7720 KB Output is correct
26 Correct 619 ms 7932 KB Output is correct
27 Correct 620 ms 7856 KB Output is correct
28 Correct 622 ms 7864 KB Output is correct
29 Correct 625 ms 7912 KB Output is correct
30 Correct 631 ms 7912 KB Output is correct
31 Correct 637 ms 7844 KB Output is correct
32 Correct 623 ms 7712 KB Output is correct
33 Correct 622 ms 7788 KB Output is correct
34 Correct 599 ms 7992 KB Output is correct
35 Correct 602 ms 7860 KB Output is correct
36 Correct 582 ms 7820 KB Output is correct
37 Correct 588 ms 7668 KB Output is correct
38 Correct 596 ms 7724 KB Output is correct
39 Correct 538 ms 8620 KB Output is correct
40 Correct 445 ms 7000 KB Output is correct
41 Correct 503 ms 7868 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 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 3 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 632 KB Output is correct
14 Correct 16 ms 632 KB Output is correct
15 Correct 16 ms 676 KB Output is correct
16 Correct 13 ms 632 KB Output is correct
17 Correct 12 ms 636 KB Output is correct
18 Correct 11 ms 696 KB Output is correct
19 Execution timed out 3020 ms 29756 KB Time limit exceeded
20 Halted 0 ms 0 KB -