oj.uz

답안 #755083

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
755083 2023-06-09T11:36:11 Z IloveN 서열 (APIO23_sequence) C++17
82 / 100
 2000 ms 50008 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 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);
                }
            }
        }
    }

    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);
    }
    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_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);
                }
            }
        }
        for (int x : pos[i]) {
            seg_mx.Update(x, n, -2);
            seg_mn.Update(x, n, -2);
        }
    }
    return res;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 7 ms 11988 KB Output is correct
3 Correct 7 ms 12008 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 7 ms 12040 KB Output is correct
6 Correct 7 ms 12044 KB Output is correct
7 Correct 7 ms 11988 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 7 ms 12004 KB Output is correct
10 Correct 7 ms 11988 KB Output is correct
11 Correct 7 ms 12076 KB Output is correct
12 Correct 7 ms 12088 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 7 ms 11988 KB Output is correct
3 Correct 7 ms 12008 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 7 ms 12040 KB Output is correct
6 Correct 7 ms 12044 KB Output is correct
7 Correct 7 ms 11988 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 7 ms 12004 KB Output is correct
10 Correct 7 ms 11988 KB Output is correct
11 Correct 7 ms 12076 KB Output is correct
12 Correct 7 ms 12088 KB Output is correct
13 Correct 10 ms 12116 KB Output is correct
14 Correct 10 ms 12116 KB Output is correct
15 Correct 10 ms 12116 KB Output is correct
16 Correct 10 ms 12184 KB Output is correct
17 Correct 9 ms 12116 KB Output is correct
18 Correct 10 ms 12232 KB Output is correct
19 Correct 11 ms 12204 KB Output is correct
20 Correct 10 ms 12204 KB Output is correct
21 Correct 9 ms 12116 KB Output is correct
22 Correct 10 ms 12116 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 1078 ms 44296 KB Output is correct
3 Correct 1104 ms 44280 KB Output is correct
4 Correct 1020 ms 36452 KB Output is correct
5 Correct 1181 ms 43368 KB Output is correct
6 Correct 1297 ms 43336 KB Output is correct
7 Correct 992 ms 36824 KB Output is correct
8 Correct 1063 ms 36972 KB Output is correct
9 Correct 1064 ms 36552 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 1137 ms 36592 KB Output is correct
3 Correct 1039 ms 36460 KB Output is correct
4 Correct 1109 ms 36464 KB Output is correct
5 Correct 1091 ms 36580 KB Output is correct
6 Correct 1093 ms 36544 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1661 ms 50008 KB Output is correct
2 Correct 1908 ms 49996 KB Output is correct
3 Correct 1703 ms 49428 KB Output is correct
4 Correct 1681 ms 49432 KB Output is correct
5 Correct 1492 ms 46100 KB Output is correct
6 Correct 1480 ms 46096 KB Output is correct
7 Correct 1188 ms 44892 KB Output is correct
8 Correct 1304 ms 44584 KB Output is correct

Subtask #6
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 7 ms 11988 KB Output is correct
3 Correct 7 ms 12008 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 7 ms 12040 KB Output is correct
6 Correct 7 ms 12044 KB Output is correct
7 Correct 7 ms 11988 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 7 ms 12004 KB Output is correct
10 Correct 7 ms 11988 KB Output is correct
11 Correct 7 ms 12076 KB Output is correct
12 Correct 7 ms 12088 KB Output is correct
13 Correct 10 ms 12116 KB Output is correct
14 Correct 10 ms 12116 KB Output is correct
15 Correct 10 ms 12116 KB Output is correct
16 Correct 10 ms 12184 KB Output is correct
17 Correct 9 ms 12116 KB Output is correct
18 Correct 10 ms 12232 KB Output is correct
19 Correct 11 ms 12204 KB Output is correct
20 Correct 10 ms 12204 KB Output is correct
21 Correct 9 ms 12116 KB Output is correct
22 Correct 10 ms 12116 KB Output is correct
23 Correct 242 ms 18708 KB Output is correct
24 Correct 246 ms 18708 KB Output is correct
25 Correct 217 ms 18712 KB Output is correct
26 Correct 209 ms 17792 KB Output is correct
27 Correct 205 ms 17748 KB Output is correct
28 Correct 206 ms 17776 KB Output is correct
29 Correct 166 ms 17492 KB Output is correct
30 Correct 198 ms 17584 KB Output is correct
31 Correct 149 ms 17484 KB Output is correct
32 Correct 221 ms 19620 KB Output is correct
33 Correct 286 ms 18516 KB Output is correct
34 Correct 226 ms 18532 KB Output is correct
35 Correct 207 ms 18472 KB Output is correct
36 Correct 259 ms 18476 KB Output is correct
37 Correct 277 ms 18488 KB Output is correct
38 Correct 222 ms 18528 KB Output is correct

Subtask #7
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 7 ms 11988 KB Output is correct
3 Correct 7 ms 12008 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 7 ms 12040 KB Output is correct
6 Correct 7 ms 12044 KB Output is correct
7 Correct 7 ms 11988 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 7 ms 12004 KB Output is correct
10 Correct 7 ms 11988 KB Output is correct
11 Correct 7 ms 12076 KB Output is correct
12 Correct 7 ms 12088 KB Output is correct
13 Correct 10 ms 12116 KB Output is correct
14 Correct 10 ms 12116 KB Output is correct
15 Correct 10 ms 12116 KB Output is correct
16 Correct 10 ms 12184 KB Output is correct
17 Correct 9 ms 12116 KB Output is correct
18 Correct 10 ms 12232 KB Output is correct
19 Correct 11 ms 12204 KB Output is correct
20 Correct 10 ms 12204 KB Output is correct
21 Correct 9 ms 12116 KB Output is correct
22 Correct 10 ms 12116 KB Output is correct
23 Correct 1078 ms 44296 KB Output is correct
24 Correct 1104 ms 44280 KB Output is correct
25 Correct 1020 ms 36452 KB Output is correct
26 Correct 1181 ms 43368 KB Output is correct
27 Correct 1297 ms 43336 KB Output is correct
28 Correct 992 ms 36824 KB Output is correct
29 Correct 1063 ms 36972 KB Output is correct
30 Correct 1064 ms 36552 KB Output is correct
31 Correct 1137 ms 36592 KB Output is correct
32 Correct 1039 ms 36460 KB Output is correct
33 Correct 1109 ms 36464 KB Output is correct
34 Correct 1091 ms 36580 KB Output is correct
35 Correct 1093 ms 36544 KB Output is correct
36 Correct 1661 ms 50008 KB Output is correct
37 Correct 1908 ms 49996 KB Output is correct
38 Correct 1703 ms 49428 KB Output is correct
39 Correct 1681 ms 49432 KB Output is correct
40 Correct 1492 ms 46100 KB Output is correct
41 Correct 1480 ms 46096 KB Output is correct
42 Correct 1188 ms 44892 KB Output is correct
43 Correct 1304 ms 44584 KB Output is correct
44 Correct 242 ms 18708 KB Output is correct
45 Correct 246 ms 18708 KB Output is correct
46 Correct 217 ms 18712 KB Output is correct
47 Correct 209 ms 17792 KB Output is correct
48 Correct 205 ms 17748 KB Output is correct
49 Correct 206 ms 17776 KB Output is correct
50 Correct 166 ms 17492 KB Output is correct
51 Correct 198 ms 17584 KB Output is correct
52 Correct 149 ms 17484 KB Output is correct
53 Correct 221 ms 19620 KB Output is correct
54 Correct 286 ms 18516 KB Output is correct
55 Correct 226 ms 18532 KB Output is correct
56 Correct 207 ms 18472 KB Output is correct
57 Correct 259 ms 18476 KB Output is correct
58 Correct 277 ms 18488 KB Output is correct
59 Correct 222 ms 18528 KB Output is correct
60 Correct 1952 ms 44276 KB Output is correct
61 Execution timed out 2001 ms 44340 KB Time limit exceeded
62 Halted 0 ms 0 KB -