oj.uz

Submission #151557

# Submission time Handle Problem Language Result Execution time Memory
151557 2019-09-03T14:22:59 Z andrew Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 3000 ms 29088 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 6 ms 380 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 6 ms 380 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 504 KB Output is correct
13 Correct 12 ms 504 KB Output is correct
14 Correct 16 ms 504 KB Output is correct
15 Correct 16 ms 548 KB Output is correct
16 Correct 13 ms 504 KB Output is correct
17 Correct 12 ms 504 KB Output is correct
18 Correct 11 ms 632 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 242 ms 4148 KB Output is correct
2 Correct 234 ms 4080 KB Output is correct
3 Correct 228 ms 3820 KB Output is correct
4 Correct 229 ms 3988 KB Output is correct
5 Correct 227 ms 3876 KB Output is correct
6 Correct 219 ms 3944 KB Output is correct
7 Correct 214 ms 3928 KB Output is correct
8 Correct 205 ms 4260 KB Output is correct
9 Correct 151 ms 2808 KB Output is correct
10 Correct 204 ms 4080 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 6 ms 380 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 504 KB Output is correct
13 Correct 12 ms 504 KB Output is correct
14 Correct 16 ms 504 KB Output is correct
15 Correct 16 ms 548 KB Output is correct
16 Correct 13 ms 504 KB Output is correct
17 Correct 12 ms 504 KB Output is correct
18 Correct 11 ms 632 KB Output is correct
19 Correct 652 ms 7692 KB Output is correct
20 Correct 656 ms 7712 KB Output is correct
21 Correct 627 ms 7660 KB Output is correct
22 Correct 633 ms 7704 KB Output is correct
23 Correct 638 ms 7788 KB Output is correct
24 Correct 602 ms 7156 KB Output is correct
25 Correct 620 ms 7348 KB Output is correct
26 Correct 630 ms 7296 KB Output is correct
27 Correct 628 ms 7400 KB Output is correct
28 Correct 645 ms 7244 KB Output is correct
29 Correct 631 ms 7312 KB Output is correct
30 Correct 626 ms 7312 KB Output is correct
31 Correct 646 ms 7396 KB Output is correct
32 Correct 627 ms 7432 KB Output is correct
33 Correct 628 ms 7412 KB Output is correct
34 Correct 579 ms 7140 KB Output is correct
35 Correct 593 ms 7392 KB Output is correct
36 Correct 577 ms 7376 KB Output is correct
37 Correct 576 ms 7292 KB Output is correct
38 Correct 595 ms 7292 KB Output is correct
39 Correct 547 ms 8088 KB Output is correct
40 Correct 446 ms 6624 KB Output is correct
41 Correct 518 ms 7632 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 6 ms 380 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 504 KB Output is correct
13 Correct 12 ms 504 KB Output is correct
14 Correct 16 ms 504 KB Output is correct
15 Correct 16 ms 548 KB Output is correct
16 Correct 13 ms 504 KB Output is correct
17 Correct 12 ms 504 KB Output is correct
18 Correct 11 ms 632 KB Output is correct
19 Execution timed out 3033 ms 29088 KB Time limit exceeded
20 Halted 0 ms 0 KB -