oj.uz

Submission #151701

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

#define fi first
#define se second
#define m_p make_pair

using namespace std;
const int N = 4e6 + 200;

pair<pair<int, int>, int> b[N];
pair<int, int> v[N];
int t[4 * N],a[N],n,Q,limit,l,r,x,q[N],step,pos,val;
bool ans[N];
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(step > 0 && x > v[step].fi)
        {
            Pos = v[step].se;
            pos = Pos;
            val = x;
            upd(1, 1, n);
            step--;
        }
        v[++step] = {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;
    }
    stable_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 368 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 3 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 380 KB Output is correct
10 Correct 3 ms 364 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 368 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 3 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 380 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 9 ms 476 KB Output is correct
12 Correct 11 ms 632 KB Output is correct
13 Correct 12 ms 632 KB Output is correct
14 Correct 18 ms 632 KB Output is correct
15 Correct 16 ms 632 KB Output is correct
16 Correct 14 ms 632 KB Output is correct
17 Correct 12 ms 632 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 3009 ms 29868 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 5620 KB Output is correct
2 Correct 249 ms 5672 KB Output is correct
3 Correct 234 ms 5412 KB Output is correct
4 Correct 243 ms 5400 KB Output is correct
5 Correct 233 ms 5416 KB Output is correct
6 Correct 223 ms 5348 KB Output is correct
7 Correct 219 ms 5316 KB Output is correct
8 Correct 210 ms 5324 KB Output is correct
9 Correct 147 ms 3496 KB Output is correct
10 Correct 208 ms 5288 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 368 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 3 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 380 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 9 ms 476 KB Output is correct
12 Correct 11 ms 632 KB Output is correct
13 Correct 12 ms 632 KB Output is correct
14 Correct 18 ms 632 KB Output is correct
15 Correct 16 ms 632 KB Output is correct
16 Correct 14 ms 632 KB Output is correct
17 Correct 12 ms 632 KB Output is correct
18 Correct 11 ms 632 KB Output is correct
19 Correct 681 ms 11548 KB Output is correct
20 Correct 682 ms 11560 KB Output is correct
21 Correct 653 ms 11532 KB Output is correct
22 Correct 653 ms 11548 KB Output is correct
23 Correct 682 ms 11544 KB Output is correct
24 Correct 602 ms 10968 KB Output is correct
25 Correct 615 ms 11024 KB Output is correct
26 Correct 629 ms 11076 KB Output is correct
27 Correct 629 ms 11108 KB Output is correct
28 Correct 630 ms 10920 KB Output is correct
29 Correct 643 ms 11020 KB Output is correct
30 Correct 642 ms 11144 KB Output is correct
31 Correct 640 ms 11008 KB Output is correct
32 Correct 637 ms 11088 KB Output is correct
33 Correct 669 ms 11280 KB Output is correct
34 Correct 596 ms 11168 KB Output is correct
35 Correct 589 ms 11004 KB Output is correct
36 Correct 579 ms 11024 KB Output is correct
37 Correct 582 ms 11096 KB Output is correct
38 Correct 590 ms 11000 KB Output is correct
39 Correct 548 ms 11236 KB Output is correct
40 Correct 449 ms 10340 KB Output is correct
41 Correct 509 ms 11212 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 368 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 3 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 380 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 9 ms 476 KB Output is correct
12 Correct 11 ms 632 KB Output is correct
13 Correct 12 ms 632 KB Output is correct
14 Correct 18 ms 632 KB Output is correct
15 Correct 16 ms 632 KB Output is correct
16 Correct 14 ms 632 KB Output is correct
17 Correct 12 ms 632 KB Output is correct
18 Correct 11 ms 632 KB Output is correct
19 Execution timed out 3009 ms 29868 KB Time limit exceeded
20 Halted 0 ms 0 KB -