oj.uz

Submission #590611

# Submission time Handle Problem Language Result Execution time Memory
590611 2022-07-06T07:28:55 Z balbit Fish 2 (JOI22_fish2) C++14
60 / 100
 4000 ms 12212 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
#define int ll
#define ll long long
#define pii pair<ll, ll>
#define f first
#define s second

#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
#define pb push_back


#define MX(a,b) a = max(a,b)
#define MN(a,b) a = min(a,b)

#define FOR(i,a,b) for (int i = a; i<b; ++i)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)

#ifdef BALBIT
#define bug(...) cerr<<"#"<<__LINE__<<": "<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do( T && x ){cerr<<x<<endl;}
template<typename T, typename ...S> void _do( T && x, S && ...y){cerr<<x<<", "; _do(y...);}
#else
#define bug(...)
#define endl '\n'
#endif // BALBIT

const int maxn = 1e5+5;
const int inf = 0x3f3f3f3f;
int n,q;
int A[maxn];


namespace VS{ // value seg tree
    int mn[maxn*4], tg[maxn*4], cnt[maxn*4];
    inline void push(int o, int l, int r) {
        if (tg[o]) {
            mn[o] += tg[o];
            if (l != r) {
                tg[o*2] += tg[o];
                tg[o*2+1] += tg[o];
            }
            tg[o] = 0;
        }
    }
    void pull(int o) {
        mn[o] = min(mn[o*2], mn[o*2+1]);
        cnt[o] = 0;
        if (mn[o*2] == mn[o]) cnt[o] += cnt[o*2];
        if (mn[o*2+1] == mn[o]) cnt[o] += cnt[o*2+1];
    }
    void build(int o=1, int l=0, int r=maxn-1){
        if (l == r) {
            cnt[o] = 1;
            if (l < n) {
                mn[o] = 0;
            }else mn[o] = 1;
            return;
        }
        int mid = (l+r)/2;
        build(o*2,l,mid); build(o*2+1,mid+1,r);
        pull(o);
    }
    void MO(int L, int R, int v, int o=1, int l=0, int r=maxn-1) {
        push(o,l,r);
        if (l > R || r < L) return;
        if (l >= L && r <= R) {
            tg[o] += v; push(o,l,r); return;
        }
        int mid = (l+r)/2;
        MO(L,R,v,o*2,l,mid); MO(L,R,v,o*2+1,mid+1,r);
        pull(o);
    }
    int QU(int L, int R, int o=1, int l=0, int r=maxn-1) {
        if (l > R || r < L) return 0;
        push(o,l,r);
        if (l >= L && r <= R) {
            return mn[o]<=0?cnt[o]:0;
        }
        int mid = (l+r)/2;
        return QU(L,R,o*2,l,mid) + QU(L,R,o*2+1,mid+1,r);
    }
};

namespace NXTS{ // next value seg tree
    int mx[maxn*4];

    void build(int o=1, int l=0, int r=maxn-1){
        if (l == r) {
            if (l < n) {
                mx[o] = A[l];
            }else{
                mx[o] = inf;
            }
            return;
        }
        int mid = (l+r)/2;
        build(o*2,l,mid); build(o*2+1,mid+1,r);
        mx[o] = max(mx[o*2], mx[o*2+1]);
    }
    void MO(int p, int v, int o=1, int l=0, int r=maxn-1) {
        if (l > p || r < p) return;
        if (l == r) {
            mx[o] = v; return;
        }
        int mid = (l+r)/2;
        MO(p,v,o*2,l,mid); MO(p,v,o*2+1,mid+1,r);
        mx[o] = max(mx[o*2], mx[o*2+1]);
    }
    int Qright(int L, int R, int v, int o=1, int l=0, int r=maxn-1) { // rightmost point in this range geq than v
        if (mx[o] < v || l > R || r < L) return -1;
        if (l == r) return l;
        int mid = (l+r)/2;
        int gr = Qright(L,R,v,o*2+1,mid+1,r);
        if (gr == -1) return Qright(L,R,v,o*2,l,mid);
        else return gr;
    }
    int Qleft(int L, int R, int v, int o=1, int l=0, int r=maxn-1) { // rightmost point in this range geq than v
        if (mx[o] < v || l > R || r < L) return -1;
        if (l == r) return l;
        int mid = (l+r)/2;
        int gl = Qleft(L,R,v,o*2,l,mid);
        if (gl == -1) return Qleft(L,R,v,o*2+1,mid+1,r);
        else return gl;
    }
};

namespace BIT{
    // for range sum only i guess
    ll s[maxn];
    ll QU(int e) {
        ll re = 0; for (++e; e>0; e-=e&-e) re += s[e]; return re;
    }
    ll QU(int l, int r) {
        return QU(r) - QU(l-1);
    }
    void MO(int e, int v) {
        for (++e; e<maxn; e+=e&-e) {
            s[e] += v;
        }
    }
}

int toL[maxn], toR[maxn];

//vector<int> fromL[maxn], fromR[maxn]; // from my left, from my right



void updl(int v) {
    if (toL[v]!=-1) {
        int p = toL[v];
        toL[v] = -1;
        VS::MO(p+1, v-1, -1);
        bug("bye", v, p);
    }
    int P = NXTS::Qright(0,v-1,A[v]);
//    bug(v,P);
    if (P != -1 && P != v-1) {
        assert(A[P] >= A[v]);
        ll btw = BIT::QU(P+1, v-1);
        if (btw < A[v]) {
            // yay
            VS::MO(P+1, v-1, 1);
            toL[v] = P;
            bug(btw, v, P);
        }
    }
}

void updr(int v) {
    if (toR[v]!=-1) {
        int p = toR[v];
        toR[v] = -1;
        VS::MO(v+1,p-1, -1);
    }
    int P = NXTS::Qleft(v+1,n-1,A[v]);
//    bug(v,P);
    if (P != -1 && P != v+1) {
        assert(A[P] >= A[v]);
        ll btw = BIT::QU(v+1,P-1);
        if (btw < A[v]) {
            VS::MO(v+1, P-1, 1);
            toR[v] = P;
            bug(v, P);
        }
    }
}

void ptchg(int v, int val) {
    BIT::MO(v, val - A[v]); NXTS::MO(v, val);
    A[v] = val;
}

void chg(int v, int val, bool doleft, bool doright) {
    // walk left!!
    ptchg(v,val);
    updl(v); updr(v);
    if (doleft) {
        for (int u = v-1; u!=-1 && u>=0; u = NXTS::Qright(0,u-1,1+BIT::QU(u,v-1))) {
            updr(u);
        }
    }
    if (doright) {
        for (int u = v+1; u!=-1 && u<n; u = NXTS::Qleft(u+1, maxn-1, 1+BIT::QU(v+1, u))) {
            updl(u);
        }
    }
}

struct mot{
    int l,r,v;
};

ll getfast(int l, int r) {
    vector<mot > undo;

    {
        for (int u = l-1; u!=-1 && u>=0; u = NXTS::Qright(0,u-1,1+BIT::QU(u,l-1))) {
            if (toR[u] != -1) {
                VS::MO(u+1, toR[u]-1, -1);
                undo.pb({u+1, toR[u]-1, 1});
                bug(u);
            }
        }

        for (int u = l; u!=-1 && u<=r; u = NXTS::Qleft(u+1, maxn-1, 1+BIT::QU(l, u))) {
            if (A[u] > BIT::QU(l,u-1)) {
                VS::MO(l, u-1, 1);
                undo.pb({l, u-1, -1});
                bug(u);
            }
        }
    }

    {
        for (int u = r+1; u!=-1 && u<n; u = NXTS::Qleft(u+1,maxn-1,1+BIT::QU(r+1,u))) {
            if (toL[u] != -1) {
                VS::MO(toL[u]+1, u-1, -1);
                undo.pb({toL[u]+1, u-1, 1});
                bug(u);
            }
        }

        for (int u = r; u!=-1 && u>=l; u = NXTS::Qright(0, u-1, 1+BIT::QU(u, r))) {
            if (A[u] > BIT::QU(u+1,r)) {
                VS::MO(u+1, r, 1);
                undo.pb({u+1, r, -1});
                bug(u);
            }
        }
    }

    ll re = VS::QU(l,r);
    for (auto e : undo) {
        bug(e.l, e.r, e.v);
        VS::MO(e.l, e.r, e.v);
    }
    return re;
}

signed main(){
    ios::sync_with_stdio(0), cin.tie(0);

    cin>>n;
    n+=2;
    REP1(i,n-2) {
        cin>>A[i];
    }
    ll big = 1e15+10;
    A[0] = A[n-1] = big;
    REP(i,n){
        BIT::MO(i, A[i]);
    }
    VS::build(); NXTS::build();

    memset(toL, -1, sizeof toL);
    memset(toR, -1, sizeof toR);

    REP(i,n) {
        updl(i); updr(i);
    }

    cin>>q;

    while (q--) {
        int tp, l, r; cin>>tp>>l>>r;
        if (tp == 2) {
            cout<<getfast(l,r)<<endl;
        }else{
//            ptchg(l,r);
            chg(l,r,1,1);
//            updl(l); updr(l);
        }
    }


}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8032 KB Output is correct
2 Correct 5 ms 8072 KB Output is correct
3 Correct 5 ms 8020 KB Output is correct
4 Correct 5 ms 8020 KB Output is correct
5 Correct 20 ms 8180 KB Output is correct
6 Correct 16 ms 8060 KB Output is correct
7 Correct 21 ms 8184 KB Output is correct
8 Correct 16 ms 8148 KB Output is correct
9 Correct 18 ms 8148 KB Output is correct
10 Correct 9 ms 8176 KB Output is correct
11 Correct 10 ms 8172 KB Output is correct
12 Correct 8 ms 8172 KB Output is correct
13 Correct 10 ms 8180 KB Output is correct
14 Correct 8 ms 8148 KB Output is correct
15 Correct 10 ms 8180 KB Output is correct
16 Correct 9 ms 8176 KB Output is correct
17 Correct 10 ms 8172 KB Output is correct
18 Correct 10 ms 8148 KB Output is correct
19 Correct 8 ms 8076 KB Output is correct
20 Correct 8 ms 8148 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8036 KB Output is correct
2 Correct 61 ms 11596 KB Output is correct
3 Correct 96 ms 11596 KB Output is correct
4 Correct 69 ms 11564 KB Output is correct
5 Correct 68 ms 11644 KB Output is correct
6 Correct 56 ms 11676 KB Output is correct
7 Correct 45 ms 11656 KB Output is correct
8 Correct 69 ms 11628 KB Output is correct
9 Correct 74 ms 11576 KB Output is correct
10 Correct 72 ms 11668 KB Output is correct
11 Correct 66 ms 11628 KB Output is correct
12 Correct 53 ms 11632 KB Output is correct
13 Correct 55 ms 11568 KB Output is correct
14 Correct 104 ms 11600 KB Output is correct
15 Correct 84 ms 11632 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8032 KB Output is correct
2 Correct 5 ms 8072 KB Output is correct
3 Correct 5 ms 8020 KB Output is correct
4 Correct 5 ms 8020 KB Output is correct
5 Correct 20 ms 8180 KB Output is correct
6 Correct 16 ms 8060 KB Output is correct
7 Correct 21 ms 8184 KB Output is correct
8 Correct 16 ms 8148 KB Output is correct
9 Correct 18 ms 8148 KB Output is correct
10 Correct 9 ms 8176 KB Output is correct
11 Correct 10 ms 8172 KB Output is correct
12 Correct 8 ms 8172 KB Output is correct
13 Correct 10 ms 8180 KB Output is correct
14 Correct 8 ms 8148 KB Output is correct
15 Correct 10 ms 8180 KB Output is correct
16 Correct 9 ms 8176 KB Output is correct
17 Correct 10 ms 8172 KB Output is correct
18 Correct 10 ms 8148 KB Output is correct
19 Correct 8 ms 8076 KB Output is correct
20 Correct 8 ms 8148 KB Output is correct
21 Correct 6 ms 8036 KB Output is correct
22 Correct 61 ms 11596 KB Output is correct
23 Correct 96 ms 11596 KB Output is correct
24 Correct 69 ms 11564 KB Output is correct
25 Correct 68 ms 11644 KB Output is correct
26 Correct 56 ms 11676 KB Output is correct
27 Correct 45 ms 11656 KB Output is correct
28 Correct 69 ms 11628 KB Output is correct
29 Correct 74 ms 11576 KB Output is correct
30 Correct 72 ms 11668 KB Output is correct
31 Correct 66 ms 11628 KB Output is correct
32 Correct 53 ms 11632 KB Output is correct
33 Correct 55 ms 11568 KB Output is correct
34 Correct 104 ms 11600 KB Output is correct
35 Correct 84 ms 11632 KB Output is correct
36 Correct 138 ms 11592 KB Output is correct
37 Correct 145 ms 11680 KB Output is correct
38 Correct 88 ms 11560 KB Output is correct
39 Correct 92 ms 11680 KB Output is correct
40 Correct 104 ms 11576 KB Output is correct
41 Correct 107 ms 11628 KB Output is correct
42 Correct 87 ms 11624 KB Output is correct
43 Correct 69 ms 11576 KB Output is correct
44 Correct 74 ms 11664 KB Output is correct
45 Correct 115 ms 11676 KB Output is correct
46 Correct 98 ms 11648 KB Output is correct
47 Correct 85 ms 11652 KB Output is correct
48 Correct 81 ms 11624 KB Output is correct
49 Correct 66 ms 11552 KB Output is correct
50 Correct 101 ms 11672 KB Output is correct
51 Correct 87 ms 11564 KB Output is correct
52 Correct 72 ms 11556 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8036 KB Output is correct
2 Correct 61 ms 11596 KB Output is correct
3 Correct 96 ms 11596 KB Output is correct
4 Correct 69 ms 11564 KB Output is correct
5 Correct 68 ms 11644 KB Output is correct
6 Correct 56 ms 11676 KB Output is correct
7 Correct 45 ms 11656 KB Output is correct
8 Correct 69 ms 11628 KB Output is correct
9 Correct 74 ms 11576 KB Output is correct
10 Correct 72 ms 11668 KB Output is correct
11 Correct 66 ms 11628 KB Output is correct
12 Correct 53 ms 11632 KB Output is correct
13 Correct 55 ms 11568 KB Output is correct
14 Correct 104 ms 11600 KB Output is correct
15 Correct 84 ms 11632 KB Output is correct
16 Correct 7 ms 8064 KB Output is correct
17 Correct 2674 ms 12024 KB Output is correct
18 Correct 2591 ms 12120 KB Output is correct
19 Correct 3010 ms 11916 KB Output is correct
20 Correct 3829 ms 11960 KB Output is correct
21 Correct 2582 ms 12024 KB Output is correct
22 Correct 2892 ms 12112 KB Output is correct
23 Correct 2703 ms 11976 KB Output is correct
24 Correct 3689 ms 12112 KB Output is correct
25 Correct 2691 ms 11952 KB Output is correct
26 Correct 3941 ms 12016 KB Output is correct
27 Correct 957 ms 12212 KB Output is correct
28 Correct 880 ms 12204 KB Output is correct
29 Correct 978 ms 12120 KB Output is correct
30 Correct 2783 ms 11868 KB Output is correct
31 Correct 2802 ms 11888 KB Output is correct
32 Execution timed out 4029 ms 11824 KB Time limit exceeded
33 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8036 KB Output is correct
2 Correct 61 ms 11596 KB Output is correct
3 Correct 96 ms 11596 KB Output is correct
4 Correct 69 ms 11564 KB Output is correct
5 Correct 68 ms 11644 KB Output is correct
6 Correct 56 ms 11676 KB Output is correct
7 Correct 45 ms 11656 KB Output is correct
8 Correct 69 ms 11628 KB Output is correct
9 Correct 74 ms 11576 KB Output is correct
10 Correct 72 ms 11668 KB Output is correct
11 Correct 66 ms 11628 KB Output is correct
12 Correct 53 ms 11632 KB Output is correct
13 Correct 55 ms 11568 KB Output is correct
14 Correct 104 ms 11600 KB Output is correct
15 Correct 84 ms 11632 KB Output is correct
16 Correct 5 ms 8020 KB Output is correct
17 Correct 1635 ms 11712 KB Output is correct
18 Correct 1351 ms 11644 KB Output is correct
19 Correct 1873 ms 11784 KB Output is correct
20 Correct 968 ms 11820 KB Output is correct
21 Correct 1361 ms 11836 KB Output is correct
22 Correct 996 ms 11720 KB Output is correct
23 Correct 1529 ms 11792 KB Output is correct
24 Correct 956 ms 11876 KB Output is correct
25 Correct 1415 ms 11840 KB Output is correct
26 Correct 661 ms 11904 KB Output is correct
27 Correct 631 ms 11720 KB Output is correct
28 Correct 801 ms 11800 KB Output is correct
29 Correct 596 ms 11848 KB Output is correct
30 Correct 810 ms 11800 KB Output is correct
31 Correct 885 ms 11668 KB Output is correct
32 Correct 907 ms 11852 KB Output is correct
33 Correct 776 ms 11636 KB Output is correct
34 Correct 925 ms 11872 KB Output is correct
35 Correct 850 ms 11724 KB Output is correct
36 Correct 864 ms 11828 KB Output is correct
37 Correct 1124 ms 11904 KB Output is correct
38 Correct 790 ms 12036 KB Output is correct
39 Correct 661 ms 11876 KB Output is correct
40 Correct 618 ms 12128 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8032 KB Output is correct
2 Correct 5 ms 8072 KB Output is correct
3 Correct 5 ms 8020 KB Output is correct
4 Correct 5 ms 8020 KB Output is correct
5 Correct 20 ms 8180 KB Output is correct
6 Correct 16 ms 8060 KB Output is correct
7 Correct 21 ms 8184 KB Output is correct
8 Correct 16 ms 8148 KB Output is correct
9 Correct 18 ms 8148 KB Output is correct
10 Correct 9 ms 8176 KB Output is correct
11 Correct 10 ms 8172 KB Output is correct
12 Correct 8 ms 8172 KB Output is correct
13 Correct 10 ms 8180 KB Output is correct
14 Correct 8 ms 8148 KB Output is correct
15 Correct 10 ms 8180 KB Output is correct
16 Correct 9 ms 8176 KB Output is correct
17 Correct 10 ms 8172 KB Output is correct
18 Correct 10 ms 8148 KB Output is correct
19 Correct 8 ms 8076 KB Output is correct
20 Correct 8 ms 8148 KB Output is correct
21 Correct 6 ms 8036 KB Output is correct
22 Correct 61 ms 11596 KB Output is correct
23 Correct 96 ms 11596 KB Output is correct
24 Correct 69 ms 11564 KB Output is correct
25 Correct 68 ms 11644 KB Output is correct
26 Correct 56 ms 11676 KB Output is correct
27 Correct 45 ms 11656 KB Output is correct
28 Correct 69 ms 11628 KB Output is correct
29 Correct 74 ms 11576 KB Output is correct
30 Correct 72 ms 11668 KB Output is correct
31 Correct 66 ms 11628 KB Output is correct
32 Correct 53 ms 11632 KB Output is correct
33 Correct 55 ms 11568 KB Output is correct
34 Correct 104 ms 11600 KB Output is correct
35 Correct 84 ms 11632 KB Output is correct
36 Correct 138 ms 11592 KB Output is correct
37 Correct 145 ms 11680 KB Output is correct
38 Correct 88 ms 11560 KB Output is correct
39 Correct 92 ms 11680 KB Output is correct
40 Correct 104 ms 11576 KB Output is correct
41 Correct 107 ms 11628 KB Output is correct
42 Correct 87 ms 11624 KB Output is correct
43 Correct 69 ms 11576 KB Output is correct
44 Correct 74 ms 11664 KB Output is correct
45 Correct 115 ms 11676 KB Output is correct
46 Correct 98 ms 11648 KB Output is correct
47 Correct 85 ms 11652 KB Output is correct
48 Correct 81 ms 11624 KB Output is correct
49 Correct 66 ms 11552 KB Output is correct
50 Correct 101 ms 11672 KB Output is correct
51 Correct 87 ms 11564 KB Output is correct
52 Correct 72 ms 11556 KB Output is correct
53 Correct 7 ms 8064 KB Output is correct
54 Correct 2674 ms 12024 KB Output is correct
55 Correct 2591 ms 12120 KB Output is correct
56 Correct 3010 ms 11916 KB Output is correct
57 Correct 3829 ms 11960 KB Output is correct
58 Correct 2582 ms 12024 KB Output is correct
59 Correct 2892 ms 12112 KB Output is correct
60 Correct 2703 ms 11976 KB Output is correct
61 Correct 3689 ms 12112 KB Output is correct
62 Correct 2691 ms 11952 KB Output is correct
63 Correct 3941 ms 12016 KB Output is correct
64 Correct 957 ms 12212 KB Output is correct
65 Correct 880 ms 12204 KB Output is correct
66 Correct 978 ms 12120 KB Output is correct
67 Correct 2783 ms 11868 KB Output is correct
68 Correct 2802 ms 11888 KB Output is correct
69 Execution timed out 4029 ms 11824 KB Time limit exceeded
70 Halted 0 ms 0 KB -