oj.uz

Submission #974396

# Submission time Handle Problem Language Result Execution time Memory
974396 2024-05-03T09:39:36 Z Pannda Sequence (APIO23_sequence) C++17
100 / 100
 1419 ms 77704 KB 
#include "sequence.h"

#include <bits/stdc++.h>
using namespace std;

template<class Info, class Tag>
struct LazySegmentTree {
    int n;
    vector<Info> info;
    vector<Tag> tag;
    LazySegmentTree() : n(0) {}
    LazySegmentTree(int n_, Info v_ = Info()) {
        init(n_, v_);
    }
    template<class T>
    LazySegmentTree(vector<T> init_) {
        init(init_);
    }
    void init(int n_, Info v_ = Info()) {
        init(vector<Info>(n_, v_));
    }
    template<class T>
    void init(vector<T> init_) {
        n = init_.size();
        info.assign(4 << __lg(n), Info());
        tag.assign(4 << __lg(n), Tag());
        function<void(int, int, int)> build = [&](int p, int l, int r) {
            if (r - l == 1) {
                info[p] = init_[l];
                return;
            }
            int m = (l + r) / 2;
            build(2 * p, l, m);
            build(2 * p + 1, m, r);
            pull(p);
        };
        build(1, 0, n);
    }
    void pull(int p) {
        info[p] = info[2 * p] + info[2 * p + 1];
    }
    void apply(int p, const Tag &v) {
        info[p].apply(v);
        tag[p].apply(v);
    }
    void push(int p) {
        apply(2 * p, tag[p]);
        apply(2 * p + 1, tag[p]);
        tag[p] = Tag();
    }
    void modify(int p, int l, int r, int x, const Info &v) {
        if (r - l == 1) {
            info[p] = v;
            return;
        }
        int m = (l + r) / 2;
        push(p);
        if (x < m) {
            modify(2 * p, l, m, x, v);
        } else {
            modify(2 * p + 1, m, r, x, v);
        }
        pull(p);
    }
    void modify(int p, const Info &v) {
        modify(1, 0, n, p, v);
    }
    Info rangeQuery(int p, int l, int r, int x, int y) {
        if (l >= y || r <= x) {
            return Info();
        }
        if (l >= x && r <= y) {
            return info[p];
        }
        int m = (l + r) / 2;
        push(p);
        return rangeQuery(2 * p, l, m, x, y) + rangeQuery(2 * p + 1, m, r, x, y);
    }
    Info rangeQuery(int l, int r) {
        return rangeQuery(1, 0, n, l, r);
    }
    void rangeApply(int p, int l, int r, int x, int y, const Tag &v) {
        if (l >= y || r <= x) {
            return;
        }
        if (l >= x && r <= y) {
            apply(p, v);
            return;
        }
        int m = (l + r) / 2;
        push(p);
        rangeApply(2 * p, l, m, x, y, v);
        rangeApply(2 * p + 1, m, r, x, y, v);
        pull(p);
    }
    void rangeApply(int l, int r, const Tag &v) {
        return rangeApply(1, 0, n, l, r, v);
    }
    template<class F>
    int findFirst(int p, int l, int r, int x, int y, F &&pred) {
        if (l >= y || r <= x) {
            return -1;
        }
        if (l >= x && r <= y && !pred(info[p])) {
            return -1;
        }
        if (r - l == 1) {
            return l;
        }
        int m = (l + r) / 2;
        push(p);
        int res = findFirst(2 * p, l, m, x, y, pred);
        if (res == -1) {
            res = findFirst(2 * p + 1, m, r, x, y, pred);
        }
        return res;
    }
    template<class F>
    int findFirst(int l, int r, F &&pred) {
        return findFirst(1, 0, n, l, r, pred);
    }
    template<class F>
    int findLast(int p, int l, int r, int x, int y, F &&pred) {
        if (l >= y || r <= x) {
            return -1;
        }
        if (l >= x && r <= y && !pred(info[p])) {
            return -1;
        }
        if (r - l == 1) {
            return l;
        }
        int m = (l + r) / 2;
        push(p);
        int res = findLast(2 * p + 1, m, r, x, y, pred);
        if (res == -1) {
            res = findLast(2 * p, l, m, x, y, pred);
        }
        return res;
    }
    template<class F>
    int findLast(int l, int r, F &&pred) {
        return findLast(1, 0, n, l, r, pred);
    }
};

struct Tag {
    int add = 0;
    void apply(const Tag &t) & {
        add += t.add;
    }
};

constexpr int INF = 1e9;
struct Info {
    int mx = -INF;
    void apply(const Tag &t) & {
        mx += t.add;
    }
    Info operator+(const Info &b) {
        return {max(mx, b.mx)};
    }
};

struct Fenwick {
    int n;
    vector<int> bit;

    Fenwick(int n) : n(n), bit(n + 1, 0) {}

    void add(int i, int delta) {
        for (i++; i <= n; i += i & -i) {
            bit[i] += delta;
        }
    }

    int sum(int i) {
        int res = 0;
        for (; i > 0; i -= i & -i) {
            res += bit[i];
        }
        return res;
    }

    int sum(int ql, int qr) {
        return sum(qr) - sum(ql);
    }
};

int sequence(int n, vector<int> a) {
    vector<vector<int>> mp(n);
    for (int i = 0; i < n; i++) {
        a[i]--;
        mp[a[i]].push_back(i);
    }

    int x = 2;

    Fenwick fen(n);
    vector<Info> lr(n + 1), rl(n + 1);
    for (int i = 0; i <= n; i++) {
        lr[i] = {-i};
        rl[i] = {i - n};
    }
    LazySegmentTree<Info, Tag> seg_le_lr(lr);
    LazySegmentTree<Info, Tag> seg_le_rl(rl);
    LazySegmentTree<Info, Tag> seg_ge_lr(lr);
    LazySegmentTree<Info, Tag> seg_ge_rl(rl);
    for (int i = 0; i < n; i++) {
        seg_ge_lr.rangeApply(i + 1, n + 1, {+2});
        seg_ge_rl.rangeApply(0, i + 1, {+2});
    }

    for (int med = 0; med < n; med++) {
        if (mp[med].empty()) continue;
        for (int i : mp[med]) {
            fen.add(i, +1);
            seg_le_lr.rangeApply(i + 1, n + 1, {+2});
            seg_le_rl.rangeApply(0, i + 1, {+2});
        }
        for (int ii = 0; ii + x <= mp[med].size(); ii++) {
            int l = mp[med][ii];
            int r = mp[med][ii + x - 1] + 1;
            int lem = fen.sum(l, r);
            int gem = (r - l) - lem + x;
            if (2 * lem >= r - l && 2 * gem >= r - l) {
                x++;
                ii--;
                continue;
            }
            if (2 * lem < r - l) {
                int val = 2 * lem - r + l; // < 0
                int up = seg_le_lr.rangeQuery(r, n + 1).mx - seg_le_lr.rangeQuery(r, r + 1).mx + seg_le_rl.rangeQuery(0, l + 1).mx - seg_le_rl.rangeQuery(l, l + 1).mx;
                if (val + up >= 0) {
                    x++;
                    ii--;
                    continue;
                }
            } else {
                int val = 2 * gem - r + l; // < 0
                int up = seg_ge_lr.rangeQuery(r, n + 1).mx - seg_ge_lr.rangeQuery(r, r + 1).mx + seg_ge_rl.rangeQuery(0, l + 1).mx - seg_ge_rl.rangeQuery(l, l + 1).mx;
                if (val + up >= 0) {
                    x++;
                    ii--;
                }
            }
        }
        for (int i : mp[med]) {
            seg_ge_lr.rangeApply(i + 1, n + 1, {-2});
            seg_ge_rl.rangeApply(0, i + 1, {-2});
        }
    }

    return x - 1    ;
}

Compilation message

sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:221:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  221 |         for (int ii = 0; ii + x <= mp[med].size(); ii++) {
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 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 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 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 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 3 ms 692 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 712 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 3 ms 604 KB Output is correct
22 Correct 3 ms 708 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 837 ms 68504 KB Output is correct
3 Correct 816 ms 71796 KB Output is correct
4 Correct 800 ms 61456 KB Output is correct
5 Correct 840 ms 70936 KB Output is correct
6 Correct 816 ms 70920 KB Output is correct
7 Correct 732 ms 62452 KB Output is correct
8 Correct 801 ms 62708 KB Output is correct
9 Correct 731 ms 61600 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 738 ms 62888 KB Output is correct
3 Correct 853 ms 61704 KB Output is correct
4 Correct 875 ms 61680 KB Output is correct
5 Correct 927 ms 61868 KB Output is correct
6 Correct 919 ms 61516 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1073 ms 74392 KB Output is correct
2 Correct 1008 ms 77704 KB Output is correct
3 Correct 1112 ms 76932 KB Output is correct
4 Correct 1032 ms 76928 KB Output is correct
5 Correct 954 ms 73612 KB Output is correct
6 Correct 948 ms 73596 KB Output is correct
7 Correct 870 ms 72400 KB Output is correct
8 Correct 818 ms 72172 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 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 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 3 ms 692 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 712 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 3 ms 604 KB Output is correct
22 Correct 3 ms 708 KB Output is correct
23 Correct 135 ms 14608 KB Output is correct
24 Correct 138 ms 14612 KB Output is correct
25 Correct 134 ms 14588 KB Output is correct
26 Correct 156 ms 13560 KB Output is correct
27 Correct 135 ms 13568 KB Output is correct
28 Correct 138 ms 13572 KB Output is correct
29 Correct 118 ms 13316 KB Output is correct
30 Correct 124 ms 13560 KB Output is correct
31 Correct 101 ms 13436 KB Output is correct
32 Correct 110 ms 15616 KB Output is correct
33 Correct 127 ms 14588 KB Output is correct
34 Correct 129 ms 14592 KB Output is correct
35 Correct 128 ms 14328 KB Output is correct
36 Correct 133 ms 14592 KB Output is correct
37 Correct 140 ms 14588 KB Output is correct
38 Correct 133 ms 14596 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 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 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 3 ms 692 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 712 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 3 ms 604 KB Output is correct
22 Correct 3 ms 708 KB Output is correct
23 Correct 837 ms 68504 KB Output is correct
24 Correct 816 ms 71796 KB Output is correct
25 Correct 800 ms 61456 KB Output is correct
26 Correct 840 ms 70936 KB Output is correct
27 Correct 816 ms 70920 KB Output is correct
28 Correct 732 ms 62452 KB Output is correct
29 Correct 801 ms 62708 KB Output is correct
30 Correct 731 ms 61600 KB Output is correct
31 Correct 738 ms 62888 KB Output is correct
32 Correct 853 ms 61704 KB Output is correct
33 Correct 875 ms 61680 KB Output is correct
34 Correct 927 ms 61868 KB Output is correct
35 Correct 919 ms 61516 KB Output is correct
36 Correct 1073 ms 74392 KB Output is correct
37 Correct 1008 ms 77704 KB Output is correct
38 Correct 1112 ms 76932 KB Output is correct
39 Correct 1032 ms 76928 KB Output is correct
40 Correct 954 ms 73612 KB Output is correct
41 Correct 948 ms 73596 KB Output is correct
42 Correct 870 ms 72400 KB Output is correct
43 Correct 818 ms 72172 KB Output is correct
44 Correct 135 ms 14608 KB Output is correct
45 Correct 138 ms 14612 KB Output is correct
46 Correct 134 ms 14588 KB Output is correct
47 Correct 156 ms 13560 KB Output is correct
48 Correct 135 ms 13568 KB Output is correct
49 Correct 138 ms 13572 KB Output is correct
50 Correct 118 ms 13316 KB Output is correct
51 Correct 124 ms 13560 KB Output is correct
52 Correct 101 ms 13436 KB Output is correct
53 Correct 110 ms 15616 KB Output is correct
54 Correct 127 ms 14588 KB Output is correct
55 Correct 129 ms 14592 KB Output is correct
56 Correct 128 ms 14328 KB Output is correct
57 Correct 133 ms 14592 KB Output is correct
58 Correct 140 ms 14588 KB Output is correct
59 Correct 133 ms 14596 KB Output is correct
60 Correct 1385 ms 71812 KB Output is correct
61 Correct 1383 ms 71900 KB Output is correct
62 Correct 1364 ms 71944 KB Output is correct
63 Correct 1282 ms 63616 KB Output is correct
64 Correct 1275 ms 63628 KB Output is correct
65 Correct 1281 ms 63592 KB Output is correct
66 Correct 850 ms 61480 KB Output is correct
67 Correct 848 ms 61712 KB Output is correct
68 Correct 722 ms 64120 KB Output is correct
69 Correct 773 ms 77692 KB Output is correct
70 Correct 1302 ms 70904 KB Output is correct
71 Correct 1274 ms 70660 KB Output is correct
72 Correct 1248 ms 70388 KB Output is correct
73 Correct 1265 ms 70644 KB Output is correct
74 Correct 1348 ms 70392 KB Output is correct
75 Correct 1419 ms 70748 KB Output is correct