oj.uz

Submission #1091679

# Submission time Handle Problem Language Result Execution time Memory
1091679 2024-09-21T19:28:39 Z ASN49K Safety (NOI18_safety) C++14
100 / 100
 291 ms 21076 KB 
#include <bits/stdc++.h>
using namespace std;
using i64=long long;
#define UNUSED -1
#define all(x) x.begin(),x.end()
#define pb push_back
const int mod=1e9+7,inf=1e9+1;
const int N=2e5;
mt19937 rng(69);
struct node
{
    i64 key;
    int pri,cnt;
    i64 lazy;
    node* l,* r;

    node(int key)
    {
        this->key=key;
        pri=rng();
        cnt=1;
        lazy=0;
        l=r=nullptr;
    }
    void add(int x)
    {
        key+=x;
        lazy+=x;
    }
    void push_down()
    {
        if(l!=nullptr)l->add(lazy);
        if(r!=nullptr)r->add(lazy);
        lazy=0;
    }
};
int count(node* t)
{
    if(t==nullptr)
    {
        return 0;
    }
    return t->cnt;
}
void recalc(node* t)
{
    t->cnt=count(t->l)+count(t->r)+1;
}

void split(node* t,node*& l,node*& r,int cnt)
{
    if(t==nullptr)
    {
        l=r=nullptr;
        return;
    }
    t->push_down();
    if(count(t->l)+1<=cnt)
    {
        split(t->r,t->r,r,cnt-count(t->l)-1);
        l=t;
    }
    else
    {
        split(t->l,l,t->l,cnt);
        r=t;
    }
    recalc(t);
}

void split_key(node* t,node*& l,node*& r,int key)
{
    if(t==nullptr)
    {
        l=r=nullptr;
        return;
    }
    t->push_down();
    if(t->key<=key)
    {
        split_key(t->r,t->r,r,key);
        l=t;
    }
    else
    {
        split_key(t->l,l,t->l,key);
        r=t;
    }
    recalc(t);
}


void merge(node*& t,node* l,node* r)
{
    if(l==nullptr)
    {
        t=r;
        return;
    }
    if(r==nullptr)
    {
        t=l;
        return;
    }
    l->push_down();
    r->push_down();
    if(l->pri >= r->pri)
    {
        merge(l->r,l->r,r);
        t=l;
    }
    else
    {
        merge(r->l,l,r->l);
        t=r;
    }
    recalc(t);
}

int leftest(node*& t)
{
    if(t->l==nullptr)
    {
        return t->key;
    }
    t->push_down();
    return leftest(t->l);
}
int rightest(node*& t)
{
    if(t->r==nullptr)
    {
        return t->key;
    }
    t->push_down();
    return rightest(t->r);
}
void print(node* t)
{
    if(t==nullptr)
    {
        return;
    }
    t->push_down();
    print(t->l);
    cout<<t->key<<' ';
    print(t->r);
}
int n,h;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>h;
    node* root=nullptr;
    i64 rez=0;
    int last_l=0,last_r=0;
    for(int i=1;i<=n;i++)
    {
        int x;
        cin>>x;
        if(i!=1)
        {
            rez+=max(last_l-x , 0);
            rez+=max(x-last_r , 0);
        }
        node *l,*r;
        split_key(root,l,r,x);

        merge(l,l,new node(x));
        merge(l,l,new node(x));
        merge(root,l,r);
        split(root,l,r,i);
        assert(l!=nullptr);
        assert(r!=nullptr);
        l->add(-h);
        r->add(h);
        last_l=rightest(l),last_r=leftest(r);
        merge(root,l,r);

    }
    cout<<rez;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 13792 KB Output is correct
2 Correct 247 ms 19796 KB Output is correct
3 Correct 253 ms 20564 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 4 ms 860 KB Output is correct
29 Correct 5 ms 732 KB Output is correct
30 Correct 4 ms 860 KB Output is correct
31 Correct 4 ms 604 KB Output is correct
32 Correct 3 ms 860 KB Output is correct
33 Correct 6 ms 860 KB Output is correct
34 Correct 4 ms 872 KB Output is correct

Subtask #8
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 4 ms 860 KB Output is correct
35 Correct 5 ms 732 KB Output is correct
36 Correct 4 ms 860 KB Output is correct
37 Correct 4 ms 604 KB Output is correct
38 Correct 3 ms 860 KB Output is correct
39 Correct 6 ms 860 KB Output is correct
40 Correct 4 ms 872 KB Output is correct
41 Correct 4 ms 860 KB Output is correct
42 Correct 3 ms 604 KB Output is correct
43 Correct 4 ms 732 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 4 ms 888 KB Output is correct
46 Correct 4 ms 856 KB Output is correct

Subtask #9
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 165 ms 13792 KB Output is correct
20 Correct 247 ms 19796 KB Output is correct
21 Correct 253 ms 20564 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 4 ms 860 KB Output is correct
38 Correct 5 ms 732 KB Output is correct
39 Correct 4 ms 860 KB Output is correct
40 Correct 4 ms 604 KB Output is correct
41 Correct 3 ms 860 KB Output is correct
42 Correct 6 ms 860 KB Output is correct
43 Correct 4 ms 872 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 3 ms 604 KB Output is correct
46 Correct 4 ms 732 KB Output is correct
47 Correct 4 ms 860 KB Output is correct
48 Correct 4 ms 888 KB Output is correct
49 Correct 4 ms 856 KB Output is correct
50 Correct 291 ms 21076 KB Output is correct
51 Correct 216 ms 17488 KB Output is correct
52 Correct 162 ms 16720 KB Output is correct
53 Correct 187 ms 19676 KB Output is correct
54 Correct 196 ms 20048 KB Output is correct
55 Correct 171 ms 17044 KB Output is correct
56 Correct 185 ms 18768 KB Output is correct
57 Correct 161 ms 17284 KB Output is correct
58 Correct 147 ms 14508 KB Output is correct
59 Correct 184 ms 19024 KB Output is correct