oj.uz

Submission #792775

# Submission time Handle Problem Language Result Execution time Memory
792775 2023-07-25T08:39:48 Z t6twotwo Abracadabra (CEOI22_abracadabra) C++17
100 / 100
 624 ms 42336 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N, Q;
    cin >> N >> Q;
    vector<int> A(N);
    for (int &x : A) {
        cin >> x;
    }
    vector<int> queries(Q), ans(Q);
    vector<vector<int>> q(N + 1);
    for (int i = 0; i < Q; i++) {
        int t, p;
        cin >> t >> p;
        t = min(t, N);
        p--;
        queries[i] = p;
        if (t == 0) {
            ans[i] = A[p];
        } else {
            q[t].push_back(i);
        }
    }
    vector<int> f(N, N), stk;
    for (int i = N - 1; i >= 0; i--) {
        while (!stk.empty() && A[stk.back()] < A[i]) {
            stk.pop_back();
        }
        if (!stk.empty()) {
            f[i] = stk.back();
        }
        stk.push_back(i);
    }
    vector<int> bit(N + 1);
    auto add = [&](int p, int x) {
        for (int i = p; i <= N; i += i & -i) {
            bit[i] += x;
        }
    };
    vector<int> L(N + 1), R(N + 1);
    set<tuple<int, int, int>> s, t;
    for (int i = 0; i < N; i = f[i]) {
        L[A[i]] = i;
        R[A[i]] = f[i];
        s.emplace(A[i], L[A[i]], R[A[i]]);
        add(A[i], R[A[i]] - L[A[i]]);
    }
    int T = N;
    for (int i = 1; i <= N; i++) {
        if (T > N / 2) {
            while (1) {
                auto [_, l, r] = *prev(s.end());
                if (T - r + l < N / 2) {
                    break;
                }
                T -= r - l;
                s.erase(prev(s.end()));
            }
            if (T > N / 2) {
                auto [v, l, r] = *prev(s.end());
                s.erase(prev(s.end()));
                int m = r - T + N / 2;
                s.emplace(v, l, m);
                add(v, m - r);
                R[v] = m;
                for (int i = m; i < r; i = f[i]) {
                    L[A[i]] = i;
                    R[A[i]] = min(r, f[i]);
                    s.emplace(A[i], L[A[i]], R[A[i]]);
                    add(A[i], R[A[i]] - L[A[i]]);
                }
            }
        }
        for (int k : q[i]) {
            int p = queries[k] + 1;
            int pos = 0, sum = 0;
            for (int i = 17; i >= 0; i--) {
                if (pos + (1 << i) <= N && bit[pos + (1 << i)] + sum < p) {
                    pos += 1 << i;
                    sum += bit[pos];
                }
            }
            pos++;
            ans[k] = A[L[pos] - sum + p - 1];
        }
    }
    for (int x : ans) {
        cout << x << "\n";
    }
    return 6/22;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 19984 KB Output is correct
2 Correct 191 ms 19184 KB Output is correct
3 Correct 178 ms 18724 KB Output is correct
4 Correct 172 ms 18884 KB Output is correct
5 Correct 191 ms 20432 KB Output is correct
6 Correct 176 ms 20280 KB Output is correct
7 Correct 196 ms 20740 KB Output is correct
8 Correct 215 ms 19440 KB Output is correct
9 Correct 185 ms 19620 KB Output is correct
10 Correct 200 ms 18672 KB Output is correct
11 Correct 191 ms 18804 KB Output is correct
12 Correct 164 ms 17228 KB Output is correct
13 Correct 182 ms 18660 KB Output is correct
14 Correct 197 ms 19788 KB Output is correct
15 Correct 187 ms 19376 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 158 ms 14432 KB Output is correct
18 Correct 173 ms 16228 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 349 ms 36892 KB Output is correct
2 Correct 302 ms 39492 KB Output is correct
3 Correct 243 ms 31720 KB Output is correct
4 Correct 219 ms 28616 KB Output is correct
5 Correct 222 ms 29260 KB Output is correct
6 Correct 216 ms 28108 KB Output is correct
7 Correct 248 ms 31088 KB Output is correct
8 Correct 269 ms 30760 KB Output is correct
9 Correct 208 ms 28584 KB Output is correct
10 Correct 228 ms 28712 KB Output is correct
11 Correct 193 ms 27348 KB Output is correct
12 Correct 218 ms 26472 KB Output is correct
13 Correct 287 ms 28656 KB Output is correct
14 Correct 231 ms 26524 KB Output is correct
15 Correct 248 ms 29216 KB Output is correct
16 Correct 21 ms 10164 KB Output is correct
17 Correct 224 ms 39220 KB Output is correct
18 Correct 166 ms 25324 KB Output is correct
19 Correct 53 ms 14276 KB Output is correct
20 Correct 67 ms 14956 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 12764 KB Output is correct
2 Correct 61 ms 13632 KB Output is correct
3 Correct 78 ms 12040 KB Output is correct
4 Correct 40 ms 8880 KB Output is correct
5 Correct 55 ms 11812 KB Output is correct
6 Correct 40 ms 8996 KB Output is correct
7 Correct 48 ms 10644 KB Output is correct
8 Correct 44 ms 9684 KB Output is correct
9 Correct 52 ms 10816 KB Output is correct
10 Correct 31 ms 7848 KB Output is correct
11 Correct 37 ms 8348 KB Output is correct
12 Correct 31 ms 7856 KB Output is correct
13 Correct 33 ms 8012 KB Output is correct
14 Correct 32 ms 8132 KB Output is correct
15 Correct 30 ms 7880 KB Output is correct
16 Correct 9 ms 5204 KB Output is correct
17 Correct 40 ms 13444 KB Output is correct
18 Correct 31 ms 7380 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 19984 KB Output is correct
2 Correct 191 ms 19184 KB Output is correct
3 Correct 178 ms 18724 KB Output is correct
4 Correct 172 ms 18884 KB Output is correct
5 Correct 191 ms 20432 KB Output is correct
6 Correct 176 ms 20280 KB Output is correct
7 Correct 196 ms 20740 KB Output is correct
8 Correct 215 ms 19440 KB Output is correct
9 Correct 185 ms 19620 KB Output is correct
10 Correct 200 ms 18672 KB Output is correct
11 Correct 191 ms 18804 KB Output is correct
12 Correct 164 ms 17228 KB Output is correct
13 Correct 182 ms 18660 KB Output is correct
14 Correct 197 ms 19788 KB Output is correct
15 Correct 187 ms 19376 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 158 ms 14432 KB Output is correct
18 Correct 173 ms 16228 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 349 ms 36892 KB Output is correct
22 Correct 302 ms 39492 KB Output is correct
23 Correct 243 ms 31720 KB Output is correct
24 Correct 219 ms 28616 KB Output is correct
25 Correct 222 ms 29260 KB Output is correct
26 Correct 216 ms 28108 KB Output is correct
27 Correct 248 ms 31088 KB Output is correct
28 Correct 269 ms 30760 KB Output is correct
29 Correct 208 ms 28584 KB Output is correct
30 Correct 228 ms 28712 KB Output is correct
31 Correct 193 ms 27348 KB Output is correct
32 Correct 218 ms 26472 KB Output is correct
33 Correct 287 ms 28656 KB Output is correct
34 Correct 231 ms 26524 KB Output is correct
35 Correct 248 ms 29216 KB Output is correct
36 Correct 21 ms 10164 KB Output is correct
37 Correct 224 ms 39220 KB Output is correct
38 Correct 166 ms 25324 KB Output is correct
39 Correct 53 ms 14276 KB Output is correct
40 Correct 67 ms 14956 KB Output is correct
41 Correct 65 ms 12764 KB Output is correct
42 Correct 61 ms 13632 KB Output is correct
43 Correct 78 ms 12040 KB Output is correct
44 Correct 40 ms 8880 KB Output is correct
45 Correct 55 ms 11812 KB Output is correct
46 Correct 40 ms 8996 KB Output is correct
47 Correct 48 ms 10644 KB Output is correct
48 Correct 44 ms 9684 KB Output is correct
49 Correct 52 ms 10816 KB Output is correct
50 Correct 31 ms 7848 KB Output is correct
51 Correct 37 ms 8348 KB Output is correct
52 Correct 31 ms 7856 KB Output is correct
53 Correct 33 ms 8012 KB Output is correct
54 Correct 32 ms 8132 KB Output is correct
55 Correct 30 ms 7880 KB Output is correct
56 Correct 9 ms 5204 KB Output is correct
57 Correct 40 ms 13444 KB Output is correct
58 Correct 31 ms 7380 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 624 ms 41476 KB Output is correct
62 Correct 465 ms 42336 KB Output is correct
63 Correct 531 ms 38748 KB Output is correct
64 Correct 434 ms 34460 KB Output is correct
65 Correct 441 ms 35968 KB Output is correct
66 Correct 403 ms 34464 KB Output is correct
67 Correct 321 ms 32740 KB Output is correct
68 Correct 342 ms 32260 KB Output is correct
69 Correct 402 ms 33872 KB Output is correct
70 Correct 312 ms 30052 KB Output is correct
71 Correct 246 ms 31776 KB Output is correct
72 Correct 297 ms 30096 KB Output is correct
73 Correct 290 ms 30676 KB Output is correct
74 Correct 278 ms 31560 KB Output is correct
75 Correct 303 ms 31084 KB Output is correct
76 Correct 19 ms 10196 KB Output is correct
77 Correct 222 ms 37708 KB Output is correct
78 Correct 209 ms 26824 KB Output is correct
79 Correct 0 ms 212 KB Output is correct
80 Correct 0 ms 212 KB Output is correct