oj.uz

Submission #738022

# Submission time Handle Problem Language Result Execution time Memory
738022 2023-05-08T05:39:46 Z resting Fish 2 (JOI22_fish2) C++17
43 / 100
 1202 ms 58168 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long

const int mx = 1e5 + 5;
const ll inf = 1e15;


struct segtree2 {
    int l, r, cnt1 = 0, cnt2 = 0, lz = 0;
    segtree2* lc, * rc;
    segtree2* getmem();
    segtree2() : segtree2(-1, -1) {};
    segtree2(int l, int r) : l(l), r(r) {
        if (l == r)return;
        int m = (l + r) / 2;
        lc = getmem(); *lc = segtree2(l, m);
        rc = getmem(); *rc = segtree2(m + 1, r);
    }
    void fix() {
        if (l == r) {
            cnt1 = cnt2 = 0;
            if (lz == 1) cnt1 = 1;
            if (lz > 1) cnt2 = 1;
            return;
        }
        if (lz == 0) {
            cnt1 = lc->cnt1 + rc->cnt1;
            cnt2 = lc->cnt2 + rc->cnt2;
        } else if (lz == 1) {
            cnt2 = lc->cnt1 + rc->cnt1 + lc->cnt2 + rc->cnt2;
            cnt1 = (r - l + 1) - cnt2;
        } else {
            cnt1 = 0;
            cnt2 = (r - l + 1);
        }
    }
    void upd(int ql, int qr, int qv) {
        if (l > qr || r < ql) return;
        if (l >= ql && r <= qr) {
            lz += qv; fix();
            return;
        }
        lc->upd(ql, qr, qv);
        rc->upd(ql, qr, qv);
        fix();
    }
    int q(int ql, int qr, int qlz = 0) {
        if (l > qr || r < ql) return 0;
        lz += qlz; fix();
        int res = 0;
        if (l >= ql && r <= qr) {
            res = cnt2 + cnt1;
        } else {
            res = lc->q(ql, qr, lz) + rc->q(ql, qr, lz);
        }
        lz -= qlz; fix();
        return res;
    }
};
segtree2 mem2[mx * 4];
int memsz2 = 0;
segtree2* segtree2::getmem() { return &mem2[memsz2++]; }
segtree2 ac2;

struct segtree {
    int l, r, v, m;
    segtree* lc, * rc;
    segtree* getmem();
    vector<pair<int, int>> k;
    segtree() : segtree(-1, -1) {};
    segtree(int l, int r) : l(l), r(r) {
        m = (l + r) / 2;
        if (l == r)return;
        lc = getmem(); *lc = segtree(l, m);
        rc = getmem(); *rc = segtree(m + 1, r);
    }
    void del(int ql, int qr) {
        if (qr < m) { lc->del(ql, qr); return; }
        if (ql > m) { rc->del(ql, qr); return; }
        k.erase(find(k.begin(), k.end(), pair<int, int>(ql, qr)));
    }
    void add(int ql, int qr) {
        if (qr < m) { lc->add(ql, qr); return; }
        if (ql > m) { rc->add(ql, qr); return; }
        k.push_back({ ql, qr });
    }
    void q(int qi) {
        if (l == r)return;
        if (qi <= m)lc->q(qi);
        else rc->q(qi);
        if (qi <= m) {
            for (auto t = k.begin(); t != k.end();) {
                if (t->first <= qi) {
                    ac2.upd(t->first, t->second, -1);
                    k.erase(t);
                } else ++t;
            }
        } else {
            for (auto t = k.begin(); t != k.end(); ) {
                if (t->second >= qi) {
                    ac2.upd(t->first, t->second, -1);
                    k.erase(t);
                } else ++t;
            }
        }
    }
};
segtree mem[mx * 4];
int memsz = 0;
segtree* segtree::getmem() { return &mem[memsz++]; }


struct segtree3 {
    int l, r; ll mx = 0, sm = 0;
    segtree3* lc, * rc;
    segtree3* getmem();
    segtree3() : segtree3(-1, -1) {};
    segtree3(int l, int r) : l(l), r(r) {
        if (l == r)return;
        int m = (l + r) / 2;
        lc = getmem(); *lc = segtree3(l, m);
        rc = getmem(); *rc = segtree3(m + 1, r);
    }
    void fix() {
        if (l == r) return;
        mx = max(lc->mx, rc->mx);
        sm = lc->sm + rc->sm;
    }
    void upd(int qi, ll qv) {
        if (l > qi || r < qi) return;
        if (l == r) {
            mx = qv; sm = qv;return;
        }
        lc->upd(qi, qv); rc->upd(qi, qv);
        fix();
    }
    int walkl(int ql, ll qv) {
        if (r < ql) return -1;
        if (mx <= qv) return -1;
        if (l == r) return l;
        int v = lc->walkl(ql, qv);
        return v == -1 ? rc->walkl(ql, qv) : v;
    }
    int walkr(int qr, ll qv) {
        if (l > qr) return -1;
        if (mx <= qv) return -1;
        if (l == r) return l;
        int v = rc->walkr(qr, qv);
        return v == -1 ? lc->walkr(qr, qv) : v;
    }
    ll qsum(int ql, int qr) {
        if (l > qr || r < ql) return 0;
        if (l >= ql && r <= qr) return sm;
        return lc->qsum(ql, qr) + rc->qsum(ql, qr);
    }
};
segtree3 mem3[mx * 4];
int memsz3 = 0;
segtree3* segtree3::getmem() { return &mem3[memsz++]; }


segtree ac;  segtree3 ac3; vector<ll> ac4;
int n;

void clear(int i) {
    ac.q(i);
}

void redo(int i, bool extendleft, bool extendright) {
    //cout << "REDO " << i << endl;
    //walking time
    int l = i, r = i;
    while (1) {
        ll t = ac3.qsum(l, r);
        int wr = ac3.walkl(r + 1, t);
        int wl = ac3.walkr(l - 1, t);
        if (wl < i - 1 && !extendleft) break;
        if (wr > i + 1 && !extendright) break;
        if (wl == -1 || wr == -1) break;
        t = ac3.qsum(wl + 1, wr - 1);
        if (ac4[wl] > t && ac4[wr] > t) {
            ac.add(wl + 1, wr - 1);
            ac2.upd(wl + 1, wr - 1, 1);
        }
        l = wl + 1, r = wr - 1;
        if (ac4[wl] > ac4[wr]) {
            if (!extendright) break;
            r++;
        } else {
            if (!extendleft) break;
            l--;
        }
    }
}

int getl(int l, int r) {
    int rr = l;
    int res = l;
    while (1) {
        ll t = ac3.qsum(l, rr);
        rr = ac3.walkl(rr + 1, t);
        if (rr > r || rr == -1) break;
        t = ac3.qsum(l, rr - 1);
        if (ac4[rr] > t) res = rr;
    }
    return res;
}

int getr(int l, int r) {
    int l2 = r;
    int res = r;
    while (1) {
        ll t = ac3.qsum(l2, r);
        l2 = ac3.walkr(l2 - 1, t);
        if (l2 < l || l2 == -1) break;
        t = ac3.qsum(l2 + 1, r);
        if (ac4[l2] > t) res = l2;
    }
    return res;
}

void upd(int i, ll v, bool left, bool right) {
    ac4[i] = v; ac3.upd(i, v);
    clear(i);
    if (i < n + 1 && right)clear(i + 1);
    if (i && left)clear(i - 1);

    redo(i, 1, 1);
    if (i < n + 1 && right)redo(i + 1, 0, 1);
    if (i && left)redo(i - 1, 1, 0);
}

void solve() {
    cin >> n;
    vector<int> a(n + 1, 0); for (int i = 1; i <= n; i++) cin >> a[i];
    ac = segtree(0, n + 1); ac2 = segtree2(0, n + 1); ac3 = segtree3(0, n + 1); ac4 = vector<ll>(n + 2, 0);
    for (int i = 0; i <= n + 1; i++) { ac4[i] = a[i]; ac3.upd(i, a[i]); }
    for (int i = 0; i <= n + 1; i++) { redo(i, 1, 0); }
    int q; cin >> q;
    while (q--) {
        int t; cin >> t;
        if (t == 1) {
            int x, y; cin >> x >> y; a[x] = y;
            upd(x, y, 1, 1);
        } else {
            int l, r; cin >> l >> r;
            int l2 = getl(l, r), r2 = getr(l, r); //cout << l2 << "," << r2 << endl;
            cout << (r2 - l2 + 1 - ac2.q(l2, r2)) << endl;
        }
    }
}

int32_t main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 53460 KB Output is correct
2 Correct 24 ms 53548 KB Output is correct
3 Correct 23 ms 53452 KB Output is correct
4 Correct 24 ms 53528 KB Output is correct
5 Incorrect 26 ms 53544 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 53528 KB Output is correct
2 Correct 105 ms 56000 KB Output is correct
3 Correct 110 ms 56000 KB Output is correct
4 Correct 109 ms 56028 KB Output is correct
5 Correct 108 ms 56040 KB Output is correct
6 Correct 103 ms 56012 KB Output is correct
7 Correct 92 ms 55484 KB Output is correct
8 Correct 100 ms 56012 KB Output is correct
9 Correct 96 ms 55472 KB Output is correct
10 Correct 113 ms 55484 KB Output is correct
11 Correct 101 ms 55504 KB Output is correct
12 Correct 97 ms 55916 KB Output is correct
13 Correct 95 ms 56020 KB Output is correct
14 Correct 110 ms 56604 KB Output is correct
15 Correct 115 ms 56452 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 53460 KB Output is correct
2 Correct 24 ms 53548 KB Output is correct
3 Correct 23 ms 53452 KB Output is correct
4 Correct 24 ms 53528 KB Output is correct
5 Incorrect 26 ms 53544 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 53528 KB Output is correct
2 Correct 105 ms 56000 KB Output is correct
3 Correct 110 ms 56000 KB Output is correct
4 Correct 109 ms 56028 KB Output is correct
5 Correct 108 ms 56040 KB Output is correct
6 Correct 103 ms 56012 KB Output is correct
7 Correct 92 ms 55484 KB Output is correct
8 Correct 100 ms 56012 KB Output is correct
9 Correct 96 ms 55472 KB Output is correct
10 Correct 113 ms 55484 KB Output is correct
11 Correct 101 ms 55504 KB Output is correct
12 Correct 97 ms 55916 KB Output is correct
13 Correct 95 ms 56020 KB Output is correct
14 Correct 110 ms 56604 KB Output is correct
15 Correct 115 ms 56452 KB Output is correct
16 Correct 23 ms 53548 KB Output is correct
17 Incorrect 1085 ms 56948 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 53528 KB Output is correct
2 Correct 105 ms 56000 KB Output is correct
3 Correct 110 ms 56000 KB Output is correct
4 Correct 109 ms 56028 KB Output is correct
5 Correct 108 ms 56040 KB Output is correct
6 Correct 103 ms 56012 KB Output is correct
7 Correct 92 ms 55484 KB Output is correct
8 Correct 100 ms 56012 KB Output is correct
9 Correct 96 ms 55472 KB Output is correct
10 Correct 113 ms 55484 KB Output is correct
11 Correct 101 ms 55504 KB Output is correct
12 Correct 97 ms 55916 KB Output is correct
13 Correct 95 ms 56020 KB Output is correct
14 Correct 110 ms 56604 KB Output is correct
15 Correct 115 ms 56452 KB Output is correct
16 Correct 25 ms 53452 KB Output is correct
17 Correct 887 ms 56380 KB Output is correct
18 Correct 1028 ms 58060 KB Output is correct
19 Correct 1050 ms 56464 KB Output is correct
20 Correct 919 ms 58100 KB Output is correct
21 Correct 1202 ms 56496 KB Output is correct
22 Correct 1054 ms 58076 KB Output is correct
23 Correct 1089 ms 56364 KB Output is correct
24 Correct 989 ms 58168 KB Output is correct
25 Correct 1078 ms 56616 KB Output is correct
26 Correct 573 ms 57100 KB Output is correct
27 Correct 657 ms 57192 KB Output is correct
28 Correct 763 ms 57168 KB Output is correct
29 Correct 581 ms 56948 KB Output is correct
30 Correct 647 ms 57016 KB Output is correct
31 Correct 909 ms 57248 KB Output is correct
32 Correct 962 ms 57900 KB Output is correct
33 Correct 537 ms 55868 KB Output is correct
34 Correct 986 ms 57856 KB Output is correct
35 Correct 536 ms 55672 KB Output is correct
36 Correct 855 ms 57536 KB Output is correct
37 Correct 844 ms 57040 KB Output is correct
38 Correct 704 ms 56864 KB Output is correct
39 Correct 688 ms 57484 KB Output is correct
40 Correct 516 ms 57184 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 53460 KB Output is correct
2 Correct 24 ms 53548 KB Output is correct
3 Correct 23 ms 53452 KB Output is correct
4 Correct 24 ms 53528 KB Output is correct
5 Incorrect 26 ms 53544 KB Output isn't correct
6 Halted 0 ms 0 KB -