oj.uz

Submission #737948

# Submission time Handle Problem Language Result Execution time Memory
737948 2023-05-08T02:55:45 Z resting Fish 2 (JOI22_fish2) C++17
60 / 100
 4000 ms 92004 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma gcc optimize("O3")

#define ll long long

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

vector<pair<int, int>> res;
struct segtree {
    int l, r, v, m;
    segtree* lc, * rc;
    segtree* getmem();
    set<pair<int, int>> lm, rm;
    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; }
        lm.erase({ ql, qr });
        rm.erase({ qr, ql });
    }
    void add(int ql, int qr) {
        if (qr < m) { lc->add(ql, qr); return; }
        if (ql > m) { rc->add(ql, qr); return; }
        lm.insert({ ql, qr });
        rm.insert({ qr, ql });
    }
    void q(int qi) {
        if (l == r)return;
        if (qi <= m)lc->q(qi);
        else rc->q(qi);
        if (qi <= m) {
            for (auto t = lm.begin(); t != lm.end() && t->first <= qi; t++)
                res.push_back(*t);
        } else {
            for (auto t = rm.rbegin(); t != rm.rend() && t->first >= qi; t++)
                res.push_back({ t->second, t->first });
        }
    }
};
segtree mem[mx * 4];
int memsz = 0;
segtree* segtree::getmem() { return &mem[memsz++]; }

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;
        } 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++]; }

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; segtree2 ac2; segtree3 ac3; vector<ll> ac4;
int n;
void redo(int i) {
    //cout << "REDO " << i << endl;
    res.clear(); ac.q(i);
    for (auto& x : res) {
        auto [l, r] = x;
        //cout << "DEL " << l << " " << r << endl;
        ac.del(l, r);
        ac2.upd(l, r, -1);
    }
    //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);
        //cout << l << "," << r << "," << wl << "," << wr << endl;
        if (wl == -1 || wr == -1) break;
        t = ac3.qsum(wl + 1, wr - 1);
        if (ac4[wl] > t && ac4[wr] > t) {
            //cout << "ADD " << wl + 1 << " " << wr - 1 << " " << t << " " << ac4[wl] << " " << ac4[wr] << endl;
            ac.add(wl + 1, wr - 1);
            ac2.upd(wl + 1, wr - 1, 1);
        }
        l = wl + 1, r = wr - 1;
        if (ac4[wl] > ac4[wr]) r++;
        else l--;
    }
}

void upd(int i, ll v) {
    ac4[i] = v; ac3.upd(i, v);
    redo(i);
    if (i < n + 1)redo(i + 1);
    if (i)redo(i - 1);
}

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++) upd(i, a[i]);
    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);
        } else {
            int l, r; cin >> l >> r;
            upd(l - 1, inf); upd(r + 1, inf);
            cout << (r - l + 1 - ac2.q(l, r)) << endl;
            upd(l - 1, a[l - 1]); upd(r + 1, a[r + 1]);
        }
    }
}

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

Compilation message

fish2.cpp:4: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
    4 | #pragma gcc optimize("O3")
      |

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 81716 KB Output is correct
2 Correct 39 ms 81632 KB Output is correct
3 Correct 36 ms 81604 KB Output is correct
4 Correct 36 ms 81692 KB Output is correct
5 Correct 44 ms 81768 KB Output is correct
6 Correct 58 ms 81740 KB Output is correct
7 Correct 50 ms 81688 KB Output is correct
8 Correct 73 ms 81676 KB Output is correct
9 Correct 62 ms 81740 KB Output is correct
10 Correct 47 ms 81740 KB Output is correct
11 Correct 47 ms 81620 KB Output is correct
12 Correct 54 ms 81744 KB Output is correct
13 Correct 60 ms 81692 KB Output is correct
14 Correct 42 ms 81748 KB Output is correct
15 Correct 49 ms 81680 KB Output is correct
16 Correct 55 ms 81632 KB Output is correct
17 Correct 47 ms 81756 KB Output is correct
18 Correct 63 ms 81772 KB Output is correct
19 Correct 45 ms 81704 KB Output is correct
20 Correct 48 ms 81648 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 81624 KB Output is correct
2 Correct 242 ms 90816 KB Output is correct
3 Correct 256 ms 89928 KB Output is correct
4 Correct 233 ms 90956 KB Output is correct
5 Correct 236 ms 90044 KB Output is correct
6 Correct 192 ms 86984 KB Output is correct
7 Correct 184 ms 85316 KB Output is correct
8 Correct 194 ms 86964 KB Output is correct
9 Correct 183 ms 85248 KB Output is correct
10 Correct 220 ms 86536 KB Output is correct
11 Correct 203 ms 86364 KB Output is correct
12 Correct 199 ms 86468 KB Output is correct
13 Correct 193 ms 86544 KB Output is correct
14 Correct 209 ms 89160 KB Output is correct
15 Correct 255 ms 89040 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 81716 KB Output is correct
2 Correct 39 ms 81632 KB Output is correct
3 Correct 36 ms 81604 KB Output is correct
4 Correct 36 ms 81692 KB Output is correct
5 Correct 44 ms 81768 KB Output is correct
6 Correct 58 ms 81740 KB Output is correct
7 Correct 50 ms 81688 KB Output is correct
8 Correct 73 ms 81676 KB Output is correct
9 Correct 62 ms 81740 KB Output is correct
10 Correct 47 ms 81740 KB Output is correct
11 Correct 47 ms 81620 KB Output is correct
12 Correct 54 ms 81744 KB Output is correct
13 Correct 60 ms 81692 KB Output is correct
14 Correct 42 ms 81748 KB Output is correct
15 Correct 49 ms 81680 KB Output is correct
16 Correct 55 ms 81632 KB Output is correct
17 Correct 47 ms 81756 KB Output is correct
18 Correct 63 ms 81772 KB Output is correct
19 Correct 45 ms 81704 KB Output is correct
20 Correct 48 ms 81648 KB Output is correct
21 Correct 37 ms 81624 KB Output is correct
22 Correct 242 ms 90816 KB Output is correct
23 Correct 256 ms 89928 KB Output is correct
24 Correct 233 ms 90956 KB Output is correct
25 Correct 236 ms 90044 KB Output is correct
26 Correct 192 ms 86984 KB Output is correct
27 Correct 184 ms 85316 KB Output is correct
28 Correct 194 ms 86964 KB Output is correct
29 Correct 183 ms 85248 KB Output is correct
30 Correct 220 ms 86536 KB Output is correct
31 Correct 203 ms 86364 KB Output is correct
32 Correct 199 ms 86468 KB Output is correct
33 Correct 193 ms 86544 KB Output is correct
34 Correct 209 ms 89160 KB Output is correct
35 Correct 255 ms 89040 KB Output is correct
36 Correct 313 ms 91996 KB Output is correct
37 Correct 370 ms 90428 KB Output is correct
38 Correct 350 ms 89348 KB Output is correct
39 Correct 293 ms 92004 KB Output is correct
40 Correct 346 ms 89352 KB Output is correct
41 Correct 233 ms 86984 KB Output is correct
42 Correct 222 ms 86988 KB Output is correct
43 Correct 279 ms 85408 KB Output is correct
44 Correct 291 ms 85320 KB Output is correct
45 Correct 344 ms 87368 KB Output is correct
46 Correct 260 ms 86632 KB Output is correct
47 Correct 276 ms 84680 KB Output is correct
48 Correct 239 ms 86700 KB Output is correct
49 Correct 274 ms 86600 KB Output is correct
50 Correct 248 ms 89164 KB Output is correct
51 Correct 236 ms 89076 KB Output is correct
52 Correct 262 ms 89232 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 81624 KB Output is correct
2 Correct 242 ms 90816 KB Output is correct
3 Correct 256 ms 89928 KB Output is correct
4 Correct 233 ms 90956 KB Output is correct
5 Correct 236 ms 90044 KB Output is correct
6 Correct 192 ms 86984 KB Output is correct
7 Correct 184 ms 85316 KB Output is correct
8 Correct 194 ms 86964 KB Output is correct
9 Correct 183 ms 85248 KB Output is correct
10 Correct 220 ms 86536 KB Output is correct
11 Correct 203 ms 86364 KB Output is correct
12 Correct 199 ms 86468 KB Output is correct
13 Correct 193 ms 86544 KB Output is correct
14 Correct 209 ms 89160 KB Output is correct
15 Correct 255 ms 89040 KB Output is correct
16 Correct 35 ms 81604 KB Output is correct
17 Execution timed out 4074 ms 90200 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 81624 KB Output is correct
2 Correct 242 ms 90816 KB Output is correct
3 Correct 256 ms 89928 KB Output is correct
4 Correct 233 ms 90956 KB Output is correct
5 Correct 236 ms 90044 KB Output is correct
6 Correct 192 ms 86984 KB Output is correct
7 Correct 184 ms 85316 KB Output is correct
8 Correct 194 ms 86964 KB Output is correct
9 Correct 183 ms 85248 KB Output is correct
10 Correct 220 ms 86536 KB Output is correct
11 Correct 203 ms 86364 KB Output is correct
12 Correct 199 ms 86468 KB Output is correct
13 Correct 193 ms 86544 KB Output is correct
14 Correct 209 ms 89160 KB Output is correct
15 Correct 255 ms 89040 KB Output is correct
16 Correct 37 ms 81688 KB Output is correct
17 Correct 1616 ms 91036 KB Output is correct
18 Correct 1643 ms 91272 KB Output is correct
19 Correct 2540 ms 90476 KB Output is correct
20 Correct 1696 ms 91364 KB Output is correct
21 Correct 2867 ms 91092 KB Output is correct
22 Correct 1589 ms 91088 KB Output is correct
23 Correct 2496 ms 90608 KB Output is correct
24 Correct 1652 ms 91100 KB Output is correct
25 Correct 2476 ms 90328 KB Output is correct
26 Correct 1108 ms 87304 KB Output is correct
27 Correct 1008 ms 87168 KB Output is correct
28 Correct 1421 ms 89008 KB Output is correct
29 Correct 968 ms 87164 KB Output is correct
30 Correct 989 ms 87052 KB Output is correct
31 Correct 1447 ms 89048 KB Output is correct
32 Correct 1493 ms 89608 KB Output is correct
33 Correct 1281 ms 86360 KB Output is correct
34 Correct 1480 ms 90620 KB Output is correct
35 Correct 1279 ms 86852 KB Output is correct
36 Correct 1457 ms 89264 KB Output is correct
37 Correct 1633 ms 89012 KB Output is correct
38 Correct 1502 ms 88524 KB Output is correct
39 Correct 1163 ms 89656 KB Output is correct
40 Correct 1056 ms 89592 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 81716 KB Output is correct
2 Correct 39 ms 81632 KB Output is correct
3 Correct 36 ms 81604 KB Output is correct
4 Correct 36 ms 81692 KB Output is correct
5 Correct 44 ms 81768 KB Output is correct
6 Correct 58 ms 81740 KB Output is correct
7 Correct 50 ms 81688 KB Output is correct
8 Correct 73 ms 81676 KB Output is correct
9 Correct 62 ms 81740 KB Output is correct
10 Correct 47 ms 81740 KB Output is correct
11 Correct 47 ms 81620 KB Output is correct
12 Correct 54 ms 81744 KB Output is correct
13 Correct 60 ms 81692 KB Output is correct
14 Correct 42 ms 81748 KB Output is correct
15 Correct 49 ms 81680 KB Output is correct
16 Correct 55 ms 81632 KB Output is correct
17 Correct 47 ms 81756 KB Output is correct
18 Correct 63 ms 81772 KB Output is correct
19 Correct 45 ms 81704 KB Output is correct
20 Correct 48 ms 81648 KB Output is correct
21 Correct 37 ms 81624 KB Output is correct
22 Correct 242 ms 90816 KB Output is correct
23 Correct 256 ms 89928 KB Output is correct
24 Correct 233 ms 90956 KB Output is correct
25 Correct 236 ms 90044 KB Output is correct
26 Correct 192 ms 86984 KB Output is correct
27 Correct 184 ms 85316 KB Output is correct
28 Correct 194 ms 86964 KB Output is correct
29 Correct 183 ms 85248 KB Output is correct
30 Correct 220 ms 86536 KB Output is correct
31 Correct 203 ms 86364 KB Output is correct
32 Correct 199 ms 86468 KB Output is correct
33 Correct 193 ms 86544 KB Output is correct
34 Correct 209 ms 89160 KB Output is correct
35 Correct 255 ms 89040 KB Output is correct
36 Correct 313 ms 91996 KB Output is correct
37 Correct 370 ms 90428 KB Output is correct
38 Correct 350 ms 89348 KB Output is correct
39 Correct 293 ms 92004 KB Output is correct
40 Correct 346 ms 89352 KB Output is correct
41 Correct 233 ms 86984 KB Output is correct
42 Correct 222 ms 86988 KB Output is correct
43 Correct 279 ms 85408 KB Output is correct
44 Correct 291 ms 85320 KB Output is correct
45 Correct 344 ms 87368 KB Output is correct
46 Correct 260 ms 86632 KB Output is correct
47 Correct 276 ms 84680 KB Output is correct
48 Correct 239 ms 86700 KB Output is correct
49 Correct 274 ms 86600 KB Output is correct
50 Correct 248 ms 89164 KB Output is correct
51 Correct 236 ms 89076 KB Output is correct
52 Correct 262 ms 89232 KB Output is correct
53 Correct 35 ms 81604 KB Output is correct
54 Execution timed out 4074 ms 90200 KB Time limit exceeded
55 Halted 0 ms 0 KB -