oj.uz

Submission #755104

# Submission time Handle Problem Language Result Execution time Memory
755104 2023-06-09T12:05:19 Z IloveN Sequence (APIO23_sequence) C++17
100 / 100
 1187 ms 50016 KB 
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(vr) vr.begin(), vr.end()

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;

const int N = 5e5 + 10;

struct segment_tree_max
{
    int it[N * 4], lazy[N * 4], n, u, v, x;

	int combine(int obj1, int obj2) { return max(obj1, obj2);}

    void build(int id, int l, int r)
    {
        if (l == r)
        {
            it[id] = 0;
            lazy[id] = 0;
            return;
        }
        int mid = (l + r) >> 1;
        build(id << 1, l, mid);
        build((id << 1) | 1, mid + 1, r);
        it[id] = combine(it[id << 1], it[(id << 1) | 1]);
        lazy[id] = 0;
    }

    void init(int len)
    {
        n = len;
        build(1, 1, n);
    }

    void apply(int id, int val)
    {
        it[id] += val;
        lazy[id] += val;
    }

    void push(int id)
    {
        apply(id << 1, lazy[id]);
        apply((id << 1) | 1, lazy[id]);
        lazy[id] = 0;
    }

    void update(int id, int l, int r)
    {
        if (l > v || r < u) return;
        if (u <= l && r <= v)
        {
            apply(id, x);
            return;
        }
        int mid = (l + r) >> 1;
        push(id);
        update(id << 1, l, mid);
        update((id << 1) | 1, mid + 1, r);
        it[id] = combine(it[id << 1], it[(id << 1) | 1]);
    }

    int get(int id, int l, int r)
    {
        if (l > v || r < u) return -1e9;
        if (u <= l && r <= v) return it[id];
        int mid = (l + r) >> 1;
        push(id);
        return combine(get(id << 1, l, mid), get((id << 1) | 1, mid + 1, r));
    }

    int lw(int id, int l, int r)
    {
        if (l > v || r < u || it[id] < x) return -1;
        if (l == r) return l;
        int mid = (l + r) >> 1;
        push(id);
        int tmp = lw(id << 1, l, mid);
        if (tmp != -1) return tmp;
        return lw((id << 1) | 1, mid + 1, r);
    }

    void Update(int l, int r, int val)
    {
        u = l;
        v = r;
        x = val;
        update(1, 1, n);
    }

    int Get(int l, int r)
    {
        u = l;
        v = r;
        if (l > r) return 0;
        return get(1, 1, n);
    }

    int Lower_bound(int l, int r, int val)
    {
        u = l;
        v = r;
        x = val;
        return lw(1, 1, n);
    }
} seg_mx;

struct segment_tree_min
{
    int it[N * 4], lazy[N * 4], n, u, v, x;

	int combine(int obj1, int obj2) { return min(obj1, obj2);}

    void build(int id, int l, int r)
    {
        if (l == r)
        {
            it[id] = 0;
            lazy[id] = 0;
            return;
        }
        int mid = (l + r) >> 1;
        build(id << 1, l, mid);
        build((id << 1) | 1, mid + 1, r);
        it[id] = combine(it[id << 1], it[(id << 1) | 1]);
        lazy[id] = 0;
    }

    void init(int len)
    {
        n = len;
        build(1, 1, n);
    }

    void apply(int id, int val)
    {
        it[id] += val;
        lazy[id] += val;
    }

    void push(int id)
    {
        apply(id << 1, lazy[id]);
        apply((id << 1) | 1, lazy[id]);
        lazy[id] = 0;
    }

    void update(int id, int l, int r)
    {
        if (l > v || r < u) return;
        if (u <= l && r <= v)
        {
            apply(id, x);
            return;
        }
        int mid = (l + r) >> 1;
        push(id);
        update(id << 1, l, mid);
        update((id << 1) | 1, mid + 1, r);
        it[id] = combine(it[id << 1], it[(id << 1) | 1]);
    }

    int get(int id, int l, int r)
    {
        if (l > v || r < u) return 1e9;
        if (u <= l && r <= v) return it[id];
        int mid = (l + r) >> 1;
        push(id);
        return combine(get(id << 1, l, mid), get((id << 1) | 1, mid + 1, r));
    }

    int lw(int id, int l, int r)
    {
        if (l > v || r < u || it[id] > x) return -1;
        if (l == r) return l;
        int mid = (l + r) >> 1;
        push(id);
        int tmp = lw(id << 1, l, mid);
        if (tmp != -1) return tmp;
        return lw((id << 1) | 1, mid + 1, r);
    }

    void Update(int l, int r, int val)
    {
        u = l;
        v = r;
        x = val;
        update(1, 1, n);
    }

    int Get(int l, int r)
    {
        u = l;
        v = r;
        if (l > r) return 0;
        return get(1, 1, n);
    }

    int Lower_bound(int l, int r, int val)
    {
        u = l;
        v = r;
        x = val;
        return lw(1, 1, n);
    }
} seg_mn;

int a[N];
vi pos[N];

int sequence(int n, vi arr) {
    for (int i = 1; i <= n; ++i) a[i] = arr[i - 1];
    for (int i = 1; i <= n; ++i) pos[i].clear();
    for (int i = 1; i <= n; ++i) pos[a[i]].eb(i);
    seg_mx.init(n);
    seg_mn.init(n);
    for (int i = 1; i <= n; ++i) {
        seg_mx.Update(i, n, -1);
        seg_mn.Update(i, n, -1);
    }
    int res = 0;
    for (int i = 1; i <= n; ++i) {
        for (int j = 0; j < (int)pos[i].size(); ++j) {
            int x = pos[i][j];
            int vl = seg_mn.Get(x, x);
            int vr = seg_mn.Get(x, n);
            if (vr <= 0 && vl >= -(j + 1) * 2) res = max(res, j + 1);
            else if (vr > 0) {
                int l = seg_mx.Lower_bound(1, x - 1, vr);
                if (l != -1) {
                    int t = upper_bound(all(pos[i]), l) - pos[i].begin();
                    res = max(res, j - t + 1);
                }
            }
        }
        for (int x : pos[i]) {
            seg_mx.Update(x, n, 2);
            seg_mn.Update(x, n, 2);
        }
        for (int j = 0; j < (int)pos[i].size(); ++j) {
            int x = pos[i][j];
            int vl = seg_mx.Get(x, x);
            int vr = seg_mx.Get(x, n);
            if (vr >= 0 && vl <= (j + 1) * 2) res = max(res, j + 1);
            else if (vr < 0) {
                int l = seg_mn.Lower_bound(1, x - 1, vr);
                if (l != -1) {
                    int t = upper_bound(all(pos[i]), l) - pos[i].begin();
                    res = max(res, j - t + 1);
                }
            }
        }
    }
    return res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 12044 KB Output is correct
3 Correct 7 ms 11988 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 6 ms 12036 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 6 ms 12048 KB Output is correct
8 Correct 6 ms 11988 KB Output is correct
9 Correct 8 ms 11988 KB Output is correct
10 Correct 7 ms 12044 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 8 ms 11976 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 12044 KB Output is correct
3 Correct 7 ms 11988 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 6 ms 12036 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 6 ms 12048 KB Output is correct
8 Correct 6 ms 11988 KB Output is correct
9 Correct 8 ms 11988 KB Output is correct
10 Correct 7 ms 12044 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 8 ms 11976 KB Output is correct
13 Correct 9 ms 12116 KB Output is correct
14 Correct 9 ms 12116 KB Output is correct
15 Correct 9 ms 12108 KB Output is correct
16 Correct 9 ms 12116 KB Output is correct
17 Correct 9 ms 12116 KB Output is correct
18 Correct 8 ms 12116 KB Output is correct
19 Correct 10 ms 12208 KB Output is correct
20 Correct 10 ms 12200 KB Output is correct
21 Correct 9 ms 12116 KB Output is correct
22 Correct 9 ms 12116 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 690 ms 44216 KB Output is correct
3 Correct 709 ms 44276 KB Output is correct
4 Correct 613 ms 36456 KB Output is correct
5 Correct 702 ms 43444 KB Output is correct
6 Correct 710 ms 43308 KB Output is correct
7 Correct 610 ms 36800 KB Output is correct
8 Correct 635 ms 37052 KB Output is correct
9 Correct 604 ms 36456 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12044 KB Output is correct
2 Correct 650 ms 36592 KB Output is correct
3 Correct 674 ms 36460 KB Output is correct
4 Correct 680 ms 36460 KB Output is correct
5 Correct 704 ms 36632 KB Output is correct
6 Correct 621 ms 36540 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 913 ms 49996 KB Output is correct
2 Correct 952 ms 49996 KB Output is correct
3 Correct 943 ms 49452 KB Output is correct
4 Correct 1014 ms 49452 KB Output is correct
5 Correct 868 ms 46100 KB Output is correct
6 Correct 892 ms 46100 KB Output is correct
7 Correct 743 ms 44976 KB Output is correct
8 Correct 703 ms 44580 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 12044 KB Output is correct
3 Correct 7 ms 11988 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 6 ms 12036 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 6 ms 12048 KB Output is correct
8 Correct 6 ms 11988 KB Output is correct
9 Correct 8 ms 11988 KB Output is correct
10 Correct 7 ms 12044 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 8 ms 11976 KB Output is correct
13 Correct 9 ms 12116 KB Output is correct
14 Correct 9 ms 12116 KB Output is correct
15 Correct 9 ms 12108 KB Output is correct
16 Correct 9 ms 12116 KB Output is correct
17 Correct 9 ms 12116 KB Output is correct
18 Correct 8 ms 12116 KB Output is correct
19 Correct 10 ms 12208 KB Output is correct
20 Correct 10 ms 12200 KB Output is correct
21 Correct 9 ms 12116 KB Output is correct
22 Correct 9 ms 12116 KB Output is correct
23 Correct 151 ms 18652 KB Output is correct
24 Correct 152 ms 18704 KB Output is correct
25 Correct 163 ms 18772 KB Output is correct
26 Correct 133 ms 17792 KB Output is correct
27 Correct 139 ms 17868 KB Output is correct
28 Correct 135 ms 17748 KB Output is correct
29 Correct 111 ms 17520 KB Output is correct
30 Correct 122 ms 17572 KB Output is correct
31 Correct 90 ms 17484 KB Output is correct
32 Correct 106 ms 19620 KB Output is correct
33 Correct 146 ms 18520 KB Output is correct
34 Correct 147 ms 18516 KB Output is correct
35 Correct 145 ms 18392 KB Output is correct
36 Correct 142 ms 18388 KB Output is correct
37 Correct 142 ms 18496 KB Output is correct
38 Correct 140 ms 18516 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 12044 KB Output is correct
3 Correct 7 ms 11988 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 6 ms 12036 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 6 ms 12048 KB Output is correct
8 Correct 6 ms 11988 KB Output is correct
9 Correct 8 ms 11988 KB Output is correct
10 Correct 7 ms 12044 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 8 ms 11976 KB Output is correct
13 Correct 9 ms 12116 KB Output is correct
14 Correct 9 ms 12116 KB Output is correct
15 Correct 9 ms 12108 KB Output is correct
16 Correct 9 ms 12116 KB Output is correct
17 Correct 9 ms 12116 KB Output is correct
18 Correct 8 ms 12116 KB Output is correct
19 Correct 10 ms 12208 KB Output is correct
20 Correct 10 ms 12200 KB Output is correct
21 Correct 9 ms 12116 KB Output is correct
22 Correct 9 ms 12116 KB Output is correct
23 Correct 690 ms 44216 KB Output is correct
24 Correct 709 ms 44276 KB Output is correct
25 Correct 613 ms 36456 KB Output is correct
26 Correct 702 ms 43444 KB Output is correct
27 Correct 710 ms 43308 KB Output is correct
28 Correct 610 ms 36800 KB Output is correct
29 Correct 635 ms 37052 KB Output is correct
30 Correct 604 ms 36456 KB Output is correct
31 Correct 650 ms 36592 KB Output is correct
32 Correct 674 ms 36460 KB Output is correct
33 Correct 680 ms 36460 KB Output is correct
34 Correct 704 ms 36632 KB Output is correct
35 Correct 621 ms 36540 KB Output is correct
36 Correct 913 ms 49996 KB Output is correct
37 Correct 952 ms 49996 KB Output is correct
38 Correct 943 ms 49452 KB Output is correct
39 Correct 1014 ms 49452 KB Output is correct
40 Correct 868 ms 46100 KB Output is correct
41 Correct 892 ms 46100 KB Output is correct
42 Correct 743 ms 44976 KB Output is correct
43 Correct 703 ms 44580 KB Output is correct
44 Correct 151 ms 18652 KB Output is correct
45 Correct 152 ms 18704 KB Output is correct
46 Correct 163 ms 18772 KB Output is correct
47 Correct 133 ms 17792 KB Output is correct
48 Correct 139 ms 17868 KB Output is correct
49 Correct 135 ms 17748 KB Output is correct
50 Correct 111 ms 17520 KB Output is correct
51 Correct 122 ms 17572 KB Output is correct
52 Correct 90 ms 17484 KB Output is correct
53 Correct 106 ms 19620 KB Output is correct
54 Correct 146 ms 18520 KB Output is correct
55 Correct 147 ms 18516 KB Output is correct
56 Correct 145 ms 18392 KB Output is correct
57 Correct 142 ms 18388 KB Output is correct
58 Correct 142 ms 18496 KB Output is correct
59 Correct 140 ms 18516 KB Output is correct
60 Correct 1180 ms 44280 KB Output is correct
61 Correct 1187 ms 44268 KB Output is correct
62 Correct 1181 ms 44344 KB Output is correct
63 Correct 986 ms 37564 KB Output is correct
64 Correct 1002 ms 37436 KB Output is correct
65 Correct 989 ms 37552 KB Output is correct
66 Correct 681 ms 36596 KB Output is correct
67 Correct 702 ms 36676 KB Output is correct
68 Correct 593 ms 36452 KB Output is correct
69 Correct 670 ms 50016 KB Output is correct
70 Correct 1119 ms 43392 KB Output is correct
71 Correct 1111 ms 43176 KB Output is correct
72 Correct 1090 ms 42844 KB Output is correct
73 Correct 1181 ms 43020 KB Output is correct
74 Correct 1137 ms 42780 KB Output is correct
75 Correct 1120 ms 43076 KB Output is correct