oj.uz

Submission #960385

# Submission time Handle Problem Language Result Execution time Memory
960385 2024-04-10T11:09:44 Z tvladm2009 Sequence (APIO23_sequence) C++17
100 / 100
 1331 ms 66212 KB 
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>

using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
using ll = long long;
using ld = long double; 
const string FILENAME = "input";
const int MAXN = 500228;

vector<int> pos[MAXN];
pair<int, int> tree[4 * MAXN + 228];
int lazy[4 * MAXN + 228];

pair<int, int> join(pair<int, int> a, pair<int, int> b) {
    return mp(min(a.first, b.first), max(a.second, b.second));
}

void push(int v) {
    tree[2 * v].first += lazy[v];
    tree[2 * v + 1].first += lazy[v];
    tree[2 * v].second += lazy[v];
    tree[2 * v + 1].second += lazy[v];
    lazy[2 * v] += lazy[v];
    lazy[2 * v + 1] += lazy[v];
    lazy[v] = 0;
}

void add(int l, int r, int x, int v = 1, int tl = 0, int tr = MAXN) {
    if (l <= tl && tr <= r) {
        tree[v].first += x;
        tree[v].second += x;
        lazy[v] += x;
        return;
    }
    if (l >= tr || r <= tl) {
        return;
    }
    push(v);
    int tm = (tl + tr) / 2;
    add(l, r, x, 2 * v, tl, tm);
    add(l, r, x, 2 * v + 1, tm, tr);
    tree[v] = join(tree[2 * v], tree[2 * v + 1]);
}

pair<int, int> get(int l, int r, int v = 1, int tl = 0, int tr = MAXN) {
    if (l <= tl && tr <= r) {
        return tree[v];
    }
    if (l >= tr || r <= tl) {
        return mp(MAXN, -MAXN);
    }
    push(v);
    int tm = (tl + tr) / 2;
    auto p1 = get(l, r, 2 * v, tl, tm), p2 = get(l, r, 2 * v + 1, tm, tr);
    tree[v] = join(tree[2 * v], tree[2 * v + 1]);
    return join(p1, p2);
}

int sequence(int n, vector<int> a) {
    for (int i = 0; i < n; i++) {
        a[i]--;
        pos[a[i]].pb(i);
    }
    for (int i = 0; i < n; i++) {
        add(i + 1, n + 1, 1);
    }
    int ret = 1;
    vector<int> pref_min1(n), pref_min2(n), pref_max1(n), pref_max2(n), suff_min1(n), suff_min2(n), suff_max1(n), suff_max2(n);
    for (int val = 0; val < n; val++) {
        for (int i = 0; i < sz(pos[val]); i++) {
            pair<int, int> res = get(0, pos[val][i] + 1);
            pref_min1[i] = res.first;
            pref_max1[i] = res.second;
            res = get(pos[val][i] + 1, n + 1);
            suff_min1[i] = res.first;
            suff_max1[i] = res.second;
        }
        for (auto p: pos[val]) {
            add(p + 1, n + 1, -2);
        }
        for (int i = 0; i < sz(pos[val]); i++) {
            pair<int, int> res = get(0, pos[val][i] + 1);
            pref_min2[i] = res.first;
            pref_max2[i] = res.second;
            res = get(pos[val][i] + 1, n + 1);
            suff_min2[i] = res.first;
            suff_max2[i] = res.second;
        }
        int l = 1, r = sz(pos[val]) + 1, sol = 0;
        while (l < r - 1) {
            int m = (l + r) / 2;
            bool ok = false;
            for (int i = 0; i + m <= sz(pos[val]); i++) {
                if (pref_min1[i] <= suff_max1[i + m - 1] && suff_min1[i + m - 1] <= pref_max1[i]) {
                    ok = true;
                } else if (pref_min2[i] <= suff_max2[i + m - 1] && suff_min2[i + m - 1] <= pref_max2[i]) {
                    ok = true;
                } else if (pref_max1[i] <= suff_min1[i + m - 1] && suff_max2[i + m - 1] <= pref_min2[i]) {
                    ok = true;
                } else if (suff_max1[i] <= pref_min1[i + m - 1] && pref_max2[i + m - 1] <= suff_min2[i]) {
                    ok = true;
                }
            }
            if (ok == true) {
                l = m;
                sol = m;
            } else {
                r = m;
            }
        }
        chkmax(ret, sol);
    }
    return ret;
}

/**
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //read(FILENAME);
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    cout << sequence(n, a) << '\n';
    return 0;
}
**/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 21084 KB Output is correct
2 Correct 4 ms 21084 KB Output is correct
3 Correct 4 ms 21128 KB Output is correct
4 Correct 4 ms 21084 KB Output is correct
5 Correct 5 ms 21084 KB Output is correct
6 Correct 4 ms 21080 KB Output is correct
7 Correct 4 ms 21084 KB Output is correct
8 Correct 4 ms 21084 KB Output is correct
9 Correct 4 ms 21184 KB Output is correct
10 Correct 4 ms 21084 KB Output is correct
11 Correct 4 ms 21084 KB Output is correct
12 Correct 5 ms 21084 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 21084 KB Output is correct
2 Correct 4 ms 21084 KB Output is correct
3 Correct 4 ms 21128 KB Output is correct
4 Correct 4 ms 21084 KB Output is correct
5 Correct 5 ms 21084 KB Output is correct
6 Correct 4 ms 21080 KB Output is correct
7 Correct 4 ms 21084 KB Output is correct
8 Correct 4 ms 21084 KB Output is correct
9 Correct 4 ms 21184 KB Output is correct
10 Correct 4 ms 21084 KB Output is correct
11 Correct 4 ms 21084 KB Output is correct
12 Correct 5 ms 21084 KB Output is correct
13 Correct 8 ms 21304 KB Output is correct
14 Correct 8 ms 21136 KB Output is correct
15 Correct 9 ms 21136 KB Output is correct
16 Correct 9 ms 21084 KB Output is correct
17 Correct 8 ms 21084 KB Output is correct
18 Correct 7 ms 21084 KB Output is correct
19 Correct 8 ms 21080 KB Output is correct
20 Correct 8 ms 21084 KB Output is correct
21 Correct 9 ms 21080 KB Output is correct
22 Correct 8 ms 21080 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 21084 KB Output is correct
2 Correct 1118 ms 60308 KB Output is correct
3 Correct 1226 ms 60240 KB Output is correct
4 Correct 1032 ms 50256 KB Output is correct
5 Correct 1071 ms 59260 KB Output is correct
6 Correct 1154 ms 59264 KB Output is correct
7 Correct 1101 ms 50912 KB Output is correct
8 Correct 1042 ms 51060 KB Output is correct
9 Correct 1041 ms 49964 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 21084 KB Output is correct
2 Correct 1083 ms 50268 KB Output is correct
3 Correct 1073 ms 50364 KB Output is correct
4 Correct 979 ms 50144 KB Output is correct
5 Correct 1143 ms 50272 KB Output is correct
6 Correct 1051 ms 50216 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1213 ms 66212 KB Output is correct
2 Correct 1215 ms 66012 KB Output is correct
3 Correct 1229 ms 65412 KB Output is correct
4 Correct 1233 ms 65444 KB Output is correct
5 Correct 1100 ms 62004 KB Output is correct
6 Correct 1130 ms 62044 KB Output is correct
7 Correct 1080 ms 61008 KB Output is correct
8 Correct 1106 ms 60520 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 21084 KB Output is correct
2 Correct 4 ms 21084 KB Output is correct
3 Correct 4 ms 21128 KB Output is correct
4 Correct 4 ms 21084 KB Output is correct
5 Correct 5 ms 21084 KB Output is correct
6 Correct 4 ms 21080 KB Output is correct
7 Correct 4 ms 21084 KB Output is correct
8 Correct 4 ms 21084 KB Output is correct
9 Correct 4 ms 21184 KB Output is correct
10 Correct 4 ms 21084 KB Output is correct
11 Correct 4 ms 21084 KB Output is correct
12 Correct 5 ms 21084 KB Output is correct
13 Correct 8 ms 21304 KB Output is correct
14 Correct 8 ms 21136 KB Output is correct
15 Correct 9 ms 21136 KB Output is correct
16 Correct 9 ms 21084 KB Output is correct
17 Correct 8 ms 21084 KB Output is correct
18 Correct 7 ms 21084 KB Output is correct
19 Correct 8 ms 21080 KB Output is correct
20 Correct 8 ms 21084 KB Output is correct
21 Correct 9 ms 21080 KB Output is correct
22 Correct 8 ms 21080 KB Output is correct
23 Correct 181 ms 30268 KB Output is correct
24 Correct 202 ms 30596 KB Output is correct
25 Correct 172 ms 30512 KB Output is correct
26 Correct 170 ms 29268 KB Output is correct
27 Correct 184 ms 29408 KB Output is correct
28 Correct 171 ms 29408 KB Output is correct
29 Correct 167 ms 29008 KB Output is correct
30 Correct 163 ms 28848 KB Output is correct
31 Correct 164 ms 29132 KB Output is correct
32 Correct 170 ms 31316 KB Output is correct
33 Correct 193 ms 30248 KB Output is correct
34 Correct 171 ms 30292 KB Output is correct
35 Correct 173 ms 30260 KB Output is correct
36 Correct 179 ms 30280 KB Output is correct
37 Correct 179 ms 30488 KB Output is correct
38 Correct 191 ms 30336 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 21084 KB Output is correct
2 Correct 4 ms 21084 KB Output is correct
3 Correct 4 ms 21128 KB Output is correct
4 Correct 4 ms 21084 KB Output is correct
5 Correct 5 ms 21084 KB Output is correct
6 Correct 4 ms 21080 KB Output is correct
7 Correct 4 ms 21084 KB Output is correct
8 Correct 4 ms 21084 KB Output is correct
9 Correct 4 ms 21184 KB Output is correct
10 Correct 4 ms 21084 KB Output is correct
11 Correct 4 ms 21084 KB Output is correct
12 Correct 5 ms 21084 KB Output is correct
13 Correct 8 ms 21304 KB Output is correct
14 Correct 8 ms 21136 KB Output is correct
15 Correct 9 ms 21136 KB Output is correct
16 Correct 9 ms 21084 KB Output is correct
17 Correct 8 ms 21084 KB Output is correct
18 Correct 7 ms 21084 KB Output is correct
19 Correct 8 ms 21080 KB Output is correct
20 Correct 8 ms 21084 KB Output is correct
21 Correct 9 ms 21080 KB Output is correct
22 Correct 8 ms 21080 KB Output is correct
23 Correct 1118 ms 60308 KB Output is correct
24 Correct 1226 ms 60240 KB Output is correct
25 Correct 1032 ms 50256 KB Output is correct
26 Correct 1071 ms 59260 KB Output is correct
27 Correct 1154 ms 59264 KB Output is correct
28 Correct 1101 ms 50912 KB Output is correct
29 Correct 1042 ms 51060 KB Output is correct
30 Correct 1041 ms 49964 KB Output is correct
31 Correct 1083 ms 50268 KB Output is correct
32 Correct 1073 ms 50364 KB Output is correct
33 Correct 979 ms 50144 KB Output is correct
34 Correct 1143 ms 50272 KB Output is correct
35 Correct 1051 ms 50216 KB Output is correct
36 Correct 1213 ms 66212 KB Output is correct
37 Correct 1215 ms 66012 KB Output is correct
38 Correct 1229 ms 65412 KB Output is correct
39 Correct 1233 ms 65444 KB Output is correct
40 Correct 1100 ms 62004 KB Output is correct
41 Correct 1130 ms 62044 KB Output is correct
42 Correct 1080 ms 61008 KB Output is correct
43 Correct 1106 ms 60520 KB Output is correct
44 Correct 181 ms 30268 KB Output is correct
45 Correct 202 ms 30596 KB Output is correct
46 Correct 172 ms 30512 KB Output is correct
47 Correct 170 ms 29268 KB Output is correct
48 Correct 184 ms 29408 KB Output is correct
49 Correct 171 ms 29408 KB Output is correct
50 Correct 167 ms 29008 KB Output is correct
51 Correct 163 ms 28848 KB Output is correct
52 Correct 164 ms 29132 KB Output is correct
53 Correct 170 ms 31316 KB Output is correct
54 Correct 193 ms 30248 KB Output is correct
55 Correct 171 ms 30292 KB Output is correct
56 Correct 173 ms 30260 KB Output is correct
57 Correct 179 ms 30280 KB Output is correct
58 Correct 179 ms 30488 KB Output is correct
59 Correct 191 ms 30336 KB Output is correct
60 Correct 1317 ms 60488 KB Output is correct
61 Correct 1255 ms 60284 KB Output is correct
62 Correct 1313 ms 60300 KB Output is correct
63 Correct 1195 ms 52140 KB Output is correct
64 Correct 1197 ms 52132 KB Output is correct
65 Correct 1183 ms 52180 KB Output is correct
66 Correct 1141 ms 50272 KB Output is correct
67 Correct 1074 ms 50400 KB Output is correct
68 Correct 1094 ms 52572 KB Output is correct
69 Correct 1000 ms 66024 KB Output is correct
70 Correct 1331 ms 59376 KB Output is correct
71 Correct 1295 ms 59196 KB Output is correct
72 Correct 1187 ms 58708 KB Output is correct
73 Correct 1308 ms 59052 KB Output is correct
74 Correct 1222 ms 58724 KB Output is correct
75 Correct 1255 ms 59048 KB Output is correct