oj.uz

Submission #872309

# Submission time Handle Problem Language Result Execution time Memory
872309 2023-11-12T17:47:56 Z green_gold_dog Sequence (APIO23_sequence) C++17
100 / 100
 1898 ms 97708 KB 
#include "sequence.h"

#include <bits/stdc++.h>

using namespace std;

typedef int ll;

const ll INF = 1'000'000'000;

struct segment_tree_min {
        vector<ll> tree, m;
        ll size;
        segment_tree_min(ll n) {
                size = n;
                tree.resize(size * 4, 0);
                m.resize(size * 4, 0);
        }
        ll get(ll l, ll r) {
                return get(1, 0, size, l, r);
        }
        ll get(ll v, ll l, ll r, ll ql, ll qr) {
                if (ql <= l && r <= qr) {
                        return tree[v];
                }
                if (qr <= l || r <= ql) {
                        return INF;
                }
                ll mid = (l + r) / 2;
                return min(get(v * 2, l, mid, ql, qr), get(v * 2 + 1, mid, r, ql, qr)) + m[v];
        }
        void add(ll l, ll r, ll x) {
                add(1, 0, size, l, r, x);
        }
        void add(ll v, ll l, ll r, ll ql, ll qr, ll x) {
                if (ql <= l && r <= qr) {
                        tree[v] += x;
                        m[v] += x;
                        return;
                }
                if (qr <= l || r <= ql) {
                        return;
                }
                ll mid = (l + r) / 2;
                add(v * 2, l, mid, ql, qr, x);
                add(v * 2 + 1, mid, r, ql, qr, x);
                tree[v] = min(tree[v * 2], tree[v * 2 + 1]) + m[v];
        }
};

struct segment_tree_max {
        vector<ll> tree, m;
        ll size;
        segment_tree_max(ll n) {
                size = n;
                tree.resize(size * 4, 0);
                m.resize(size * 4, 0);
        }
        ll get(ll l, ll r) {
                return get(1, 0, size, l, r);
        }
        ll get(ll v, ll l, ll r, ll ql, ll qr) {
                if (ql <= l && r <= qr) {
                        return tree[v];
                }
                if (qr <= l || r <= ql) {
                        return -INF;
                }
                ll mid = (l + r) / 2;
                return max(get(v * 2, l, mid, ql, qr), get(v * 2 + 1, mid, r, ql, qr)) + m[v];
        }
        void add(ll l, ll r, ll x) {
                add(1, 0, size, l, r, x);
        }
        void add(ll v, ll l, ll r, ll ql, ll qr, ll x) {
                if (ql <= l && r <= qr) {
                        tree[v] += x;
                        m[v] += x;
                        return;
                }
                if (qr <= l || r <= ql) {
                        return;
                }
                ll mid = (l + r) / 2;
                add(v * 2, l, mid, ql, qr, x);
                add(v * 2 + 1, mid, r, ql, qr, x);
                tree[v] = max(tree[v * 2], tree[v * 2 + 1]) + m[v];
        }
};

ll sequence(ll n, vector<ll> a) {
        segment_tree_min sti(n), stir(n);
        segment_tree_max sta(n), star(n);
        vector<vector<ll>> all(n);
        for (ll i = 0; i < n; i++) {
                sti.add(i, n, 1);
                sta.add(i, n, 1);
                stir.add(0, i + 1, 1);
                star.add(0, i + 1, 1);
                all[a[i] - 1].push_back(i);
        }
        ll ans = 0, ns = n;
        for (ll i = 0; i < n; i++) {
                for (auto j : all[i]) {
                        sti.add(j, n, -1);
                        sti.add(j, n, -1);
                        //stir.add(0, j + 1, -1);
                        //star.add(0, j + 1, -1);
                        ns--;
                }
                ll lst = 0, sub = all[i].size();
                for (ll j = 0; j < all[i].size(); j++) {
                        ll x = all[i][j];
                        sti.add(x, n, 1);
                        sta.add(x, n, -1);
                        ll mmi = stir.get(lst, all[i][j] + 1) - ns - sub, mma = star.get(lst, all[i][j] + 1) - ns - sub;
                        ll ql = all[i][j], qr = n;
                        ll v = 1, l = 0, r = n;
                        ll msi = 0, msa = 0;
                        while (r - l > 1) {
                                msi += sti.m[v];
                                msa += sta.m[v];
                                ll mid = (l + r) / 2;
                                if (mid < ql) {
                                        l = mid;
                                        v = v * 2 + 1;
                                        continue;
                                }
                                ll mi = sti.tree[v * 2 + 1] + mmi + msi, ma = sta.tree[v * 2 + 1] + mma + msa;
                                if ((mi <= -1 && ma >= -1) || (mi <= 0 && ma >= 0) || (mi <= 1 && ma >= 1)) {
                                        v = v * 2 + 1;
                                        l = mid;
                                } else {
                                        v = v * 2;
                                        r = mid;
                                }
                        }
                        ans = max(ans, (ll)((lower_bound(all[i].begin(), all[i].end(), r) - all[i].begin()) - j));
                        sub--;
                        lst = all[i][j] + 1;
                }
                for (auto j : all[i]) {
                        sti.add(j, n, -1);
                        sta.add(j, n, -1);
                        stir.add(0, j + 1, -2);
                        star.add(0, j + 1, -2);
                        ns--;
                }
        }
        return ans;
}

Compilation message

sequence.cpp: In function 'll sequence(ll, std::vector<int>)':
sequence.cpp:112:34: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |                 for (ll j = 0; j < all[i].size(); j++) {
      |                                ~~^~~~~~~~~~~~~~~
sequence.cpp:117:44: warning: unused variable 'qr' [-Wunused-variable]
  117 |                         ll ql = all[i][j], qr = n;
      |                                            ^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 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 344 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 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 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 4 ms 604 KB Output is correct
14 Correct 4 ms 604 KB Output is correct
15 Correct 3 ms 756 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 3 ms 604 KB Output is correct
19 Correct 3 ms 604 KB Output is correct
20 Correct 5 ms 604 KB Output is correct
21 Correct 3 ms 604 KB Output is correct
22 Correct 3 ms 604 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1230 ms 88660 KB Output is correct
3 Correct 1184 ms 88652 KB Output is correct
4 Correct 1166 ms 81948 KB Output is correct
5 Correct 1211 ms 90952 KB Output is correct
6 Correct 1184 ms 90948 KB Output is correct
7 Correct 1126 ms 82588 KB Output is correct
8 Correct 1125 ms 82740 KB Output is correct
9 Correct 1145 ms 82408 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1205 ms 81948 KB Output is correct
3 Correct 1208 ms 82108 KB Output is correct
4 Correct 1221 ms 81864 KB Output is correct
5 Correct 1204 ms 82728 KB Output is correct
6 Correct 1214 ms 81856 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1431 ms 94552 KB Output is correct
2 Correct 1475 ms 94284 KB Output is correct
3 Correct 1490 ms 93820 KB Output is correct
4 Correct 1494 ms 97100 KB Output is correct
5 Correct 1324 ms 93804 KB Output is correct
6 Correct 1313 ms 93492 KB Output is correct
7 Correct 1165 ms 92544 KB Output is correct
8 Correct 1213 ms 92208 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 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 4 ms 604 KB Output is correct
14 Correct 4 ms 604 KB Output is correct
15 Correct 3 ms 756 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 3 ms 604 KB Output is correct
19 Correct 3 ms 604 KB Output is correct
20 Correct 5 ms 604 KB Output is correct
21 Correct 3 ms 604 KB Output is correct
22 Correct 3 ms 604 KB Output is correct
23 Correct 224 ms 14440 KB Output is correct
24 Correct 224 ms 14672 KB Output is correct
25 Correct 209 ms 14480 KB Output is correct
26 Correct 220 ms 13636 KB Output is correct
27 Correct 216 ms 13636 KB Output is correct
28 Correct 213 ms 13624 KB Output is correct
29 Correct 167 ms 13136 KB Output is correct
30 Correct 172 ms 13292 KB Output is correct
31 Correct 158 ms 13520 KB Output is correct
32 Correct 156 ms 15348 KB Output is correct
33 Correct 215 ms 14164 KB Output is correct
34 Correct 219 ms 14324 KB Output is correct
35 Correct 211 ms 14308 KB Output is correct
36 Correct 199 ms 14328 KB Output is correct
37 Correct 211 ms 14348 KB Output is correct
38 Correct 213 ms 14380 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 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 4 ms 604 KB Output is correct
14 Correct 4 ms 604 KB Output is correct
15 Correct 3 ms 756 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 3 ms 604 KB Output is correct
19 Correct 3 ms 604 KB Output is correct
20 Correct 5 ms 604 KB Output is correct
21 Correct 3 ms 604 KB Output is correct
22 Correct 3 ms 604 KB Output is correct
23 Correct 1230 ms 88660 KB Output is correct
24 Correct 1184 ms 88652 KB Output is correct
25 Correct 1166 ms 81948 KB Output is correct
26 Correct 1211 ms 90952 KB Output is correct
27 Correct 1184 ms 90948 KB Output is correct
28 Correct 1126 ms 82588 KB Output is correct
29 Correct 1125 ms 82740 KB Output is correct
30 Correct 1145 ms 82408 KB Output is correct
31 Correct 1205 ms 81948 KB Output is correct
32 Correct 1208 ms 82108 KB Output is correct
33 Correct 1221 ms 81864 KB Output is correct
34 Correct 1204 ms 82728 KB Output is correct
35 Correct 1214 ms 81856 KB Output is correct
36 Correct 1431 ms 94552 KB Output is correct
37 Correct 1475 ms 94284 KB Output is correct
38 Correct 1490 ms 93820 KB Output is correct
39 Correct 1494 ms 97100 KB Output is correct
40 Correct 1324 ms 93804 KB Output is correct
41 Correct 1313 ms 93492 KB Output is correct
42 Correct 1165 ms 92544 KB Output is correct
43 Correct 1213 ms 92208 KB Output is correct
44 Correct 224 ms 14440 KB Output is correct
45 Correct 224 ms 14672 KB Output is correct
46 Correct 209 ms 14480 KB Output is correct
47 Correct 220 ms 13636 KB Output is correct
48 Correct 216 ms 13636 KB Output is correct
49 Correct 213 ms 13624 KB Output is correct
50 Correct 167 ms 13136 KB Output is correct
51 Correct 172 ms 13292 KB Output is correct
52 Correct 158 ms 13520 KB Output is correct
53 Correct 156 ms 15348 KB Output is correct
54 Correct 215 ms 14164 KB Output is correct
55 Correct 219 ms 14324 KB Output is correct
56 Correct 211 ms 14308 KB Output is correct
57 Correct 199 ms 14328 KB Output is correct
58 Correct 211 ms 14348 KB Output is correct
59 Correct 213 ms 14380 KB Output is correct
60 Correct 1896 ms 91980 KB Output is correct
61 Correct 1898 ms 91988 KB Output is correct
62 Correct 1887 ms 92092 KB Output is correct
63 Correct 1781 ms 83820 KB Output is correct
64 Correct 1742 ms 84012 KB Output is correct
65 Correct 1774 ms 84016 KB Output is correct
66 Correct 1257 ms 81772 KB Output is correct
67 Correct 1216 ms 82088 KB Output is correct
68 Correct 1121 ms 84160 KB Output is correct
69 Correct 1157 ms 97708 KB Output is correct
70 Correct 1886 ms 91068 KB Output is correct
71 Correct 1845 ms 90764 KB Output is correct
72 Correct 1785 ms 90184 KB Output is correct
73 Correct 1824 ms 90608 KB Output is correct
74 Correct 1777 ms 90244 KB Output is correct
75 Correct 1783 ms 90772 KB Output is correct