oj.uz

답안 #792766

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
792766 2023-07-25T08:35:30 Z t6twotwo Abracadabra (CEOI22_abracadabra) C++17
100 / 100
 703 ms 40344 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

# 결과 실행 시간 메모리 Grader output
1 Correct 203 ms 17560 KB Output is correct
2 Correct 196 ms 16764 KB Output is correct
3 Correct 184 ms 16268 KB Output is correct
4 Correct 193 ms 16424 KB Output is correct
5 Correct 209 ms 17904 KB Output is correct
6 Correct 175 ms 17764 KB Output is correct
7 Correct 201 ms 18252 KB Output is correct
8 Correct 175 ms 16952 KB Output is correct
9 Correct 178 ms 17232 KB Output is correct
10 Correct 171 ms 16288 KB Output is correct
11 Correct 206 ms 16444 KB Output is correct
12 Correct 159 ms 14804 KB Output is correct
13 Correct 167 ms 16232 KB Output is correct
14 Correct 179 ms 17360 KB Output is correct
15 Correct 183 ms 16940 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 134 ms 12016 KB Output is correct
18 Correct 153 ms 13836 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 320 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 304 ms 33836 KB Output is correct
2 Correct 293 ms 37328 KB Output is correct
3 Correct 244 ms 29476 KB Output is correct
4 Correct 207 ms 26260 KB Output is correct
5 Correct 221 ms 27096 KB Output is correct
6 Correct 216 ms 26036 KB Output is correct
7 Correct 229 ms 28864 KB Output is correct
8 Correct 277 ms 28516 KB Output is correct
9 Correct 205 ms 26352 KB Output is correct
10 Correct 222 ms 26584 KB Output is correct
11 Correct 180 ms 23844 KB Output is correct
12 Correct 198 ms 23692 KB Output is correct
13 Correct 233 ms 26408 KB Output is correct
14 Correct 201 ms 24328 KB Output is correct
15 Correct 232 ms 27116 KB Output is correct
16 Correct 24 ms 9316 KB Output is correct
17 Correct 239 ms 35768 KB Output is correct
18 Correct 226 ms 23060 KB Output is correct
19 Correct 57 ms 11976 KB Output is correct
20 Correct 70 ms 12644 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 11388 KB Output is correct
2 Correct 72 ms 12328 KB Output is correct
3 Correct 73 ms 10740 KB Output is correct
4 Correct 44 ms 7632 KB Output is correct
5 Correct 59 ms 10452 KB Output is correct
6 Correct 41 ms 7768 KB Output is correct
7 Correct 49 ms 9400 KB Output is correct
8 Correct 52 ms 8480 KB Output is correct
9 Correct 59 ms 9468 KB Output is correct
10 Correct 33 ms 6808 KB Output is correct
11 Correct 52 ms 7236 KB Output is correct
12 Correct 40 ms 6788 KB Output is correct
13 Correct 37 ms 6920 KB Output is correct
14 Correct 41 ms 6952 KB Output is correct
15 Correct 36 ms 6836 KB Output is correct
16 Correct 12 ms 5068 KB Output is correct
17 Correct 58 ms 12472 KB Output is correct
18 Correct 42 ms 6480 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

# 결과 실행 시간 메모리 Grader output
1 Correct 203 ms 17560 KB Output is correct
2 Correct 196 ms 16764 KB Output is correct
3 Correct 184 ms 16268 KB Output is correct
4 Correct 193 ms 16424 KB Output is correct
5 Correct 209 ms 17904 KB Output is correct
6 Correct 175 ms 17764 KB Output is correct
7 Correct 201 ms 18252 KB Output is correct
8 Correct 175 ms 16952 KB Output is correct
9 Correct 178 ms 17232 KB Output is correct
10 Correct 171 ms 16288 KB Output is correct
11 Correct 206 ms 16444 KB Output is correct
12 Correct 159 ms 14804 KB Output is correct
13 Correct 167 ms 16232 KB Output is correct
14 Correct 179 ms 17360 KB Output is correct
15 Correct 183 ms 16940 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 134 ms 12016 KB Output is correct
18 Correct 153 ms 13836 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 304 ms 33836 KB Output is correct
22 Correct 293 ms 37328 KB Output is correct
23 Correct 244 ms 29476 KB Output is correct
24 Correct 207 ms 26260 KB Output is correct
25 Correct 221 ms 27096 KB Output is correct
26 Correct 216 ms 26036 KB Output is correct
27 Correct 229 ms 28864 KB Output is correct
28 Correct 277 ms 28516 KB Output is correct
29 Correct 205 ms 26352 KB Output is correct
30 Correct 222 ms 26584 KB Output is correct
31 Correct 180 ms 23844 KB Output is correct
32 Correct 198 ms 23692 KB Output is correct
33 Correct 233 ms 26408 KB Output is correct
34 Correct 201 ms 24328 KB Output is correct
35 Correct 232 ms 27116 KB Output is correct
36 Correct 24 ms 9316 KB Output is correct
37 Correct 239 ms 35768 KB Output is correct
38 Correct 226 ms 23060 KB Output is correct
39 Correct 57 ms 11976 KB Output is correct
40 Correct 70 ms 12644 KB Output is correct
41 Correct 76 ms 11388 KB Output is correct
42 Correct 72 ms 12328 KB Output is correct
43 Correct 73 ms 10740 KB Output is correct
44 Correct 44 ms 7632 KB Output is correct
45 Correct 59 ms 10452 KB Output is correct
46 Correct 41 ms 7768 KB Output is correct
47 Correct 49 ms 9400 KB Output is correct
48 Correct 52 ms 8480 KB Output is correct
49 Correct 59 ms 9468 KB Output is correct
50 Correct 33 ms 6808 KB Output is correct
51 Correct 52 ms 7236 KB Output is correct
52 Correct 40 ms 6788 KB Output is correct
53 Correct 37 ms 6920 KB Output is correct
54 Correct 41 ms 6952 KB Output is correct
55 Correct 36 ms 6836 KB Output is correct
56 Correct 12 ms 5068 KB Output is correct
57 Correct 58 ms 12472 KB Output is correct
58 Correct 42 ms 6480 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 703 ms 39476 KB Output is correct
62 Correct 549 ms 40344 KB Output is correct
63 Correct 460 ms 36692 KB Output is correct
64 Correct 416 ms 32408 KB Output is correct
65 Correct 506 ms 33832 KB Output is correct
66 Correct 483 ms 32300 KB Output is correct
67 Correct 422 ms 30632 KB Output is correct
68 Correct 452 ms 30316 KB Output is correct
69 Correct 440 ms 31872 KB Output is correct
70 Correct 330 ms 27964 KB Output is correct
71 Correct 256 ms 29652 KB Output is correct
72 Correct 341 ms 27984 KB Output is correct
73 Correct 319 ms 28564 KB Output is correct
74 Correct 293 ms 29564 KB Output is correct
75 Correct 310 ms 28968 KB Output is correct
76 Correct 21 ms 9284 KB Output is correct
77 Correct 228 ms 35548 KB Output is correct
78 Correct 218 ms 24648 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 0 ms 212 KB Output is correct