oj.uz

Submission #782347

# Submission time Handle Problem Language Result Execution time Memory
782347 2023-07-13T20:38:29 Z thimote75 Stone Arranging 2 (JOI23_ho_t1) C++14
100 / 100
 420 ms 153592 KB 
#include <bits/stdc++.h>

using namespace std;

template <typename T>
struct SGD {
    bool _update = false;
    T value;
};
template<typename T>
struct SetTree {
    vector<SGD<T>> tree;

    int start, height, size;
    SetTree (int _size, T def) {
        size = _size;
        height = ceil(log2(size));
        start = 1 << height;
        tree.resize(start << 1);

        for (auto &pos : tree) pos.value = def;
    }
    void _update (int id) {
        if (id == 0) return ;
        _update(id >> 1);

        if (id >= start || (!tree[id]._update)) return;
        tree[2 * id    ].value = tree[id].value;
        tree[2 * id + 1].value = tree[id].value;
        tree[2 * id    ]._update = true;
        tree[2 * id + 1]._update = true;
        tree[id]._update = false;
    }
    void update (int id) {
        id += start;
        _update(id);
    }
    T get (int id) {
        update(id);

        return tree[id + start].value;
    }
    void set (int i, T val) {
        _update(i);
        tree[i].value   = val;
        tree[i]._update = true;
    }
    void set (int l, int r, T val) {
        l += start; r += start;

        while (l < r) {
            if ((l & 1) == 1) set(l, val);
            if ((r & 1) == 0) set(r, val);
            l = (l + 1) >> 1;
            r = (r - 1) >> 1;
        }

        if (l == r) set (l, val);
    }
    void show () {
        for (int h = 0; h <= height; h ++) {
            int v = 1 << h;
            for (int s = 0; s < v; s ++)
                cout << tree[s + v].value << ":" << tree[s + v]._update << " ";

            cout << endl;
        }
    }
};

using idqgr = map<int, deque<int>>;

int main () {
    int N;
    cin >> N;

    SetTree<bool> tree(N, false);
    idqgr queue;
    SetTree<int> answer(N, 0);

    for (int i = 0; i < N; i ++) {
        int a; cin >> a;

        if (queue.find(a) == queue.end())
            queue.insert({ a, {} });
        deque<int> &positions = (*queue.find(a)).second;

        positions.push_back(i);
        while (tree.get(positions.front()))
            positions.pop_front();
        
        int left = positions.front();

        tree.set(left + 1, i - 1, true);
        answer.set(left, i, a);
    }

    for (int i = 0; i < N; i ++) cout << answer.get(i) << "\n";
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 4 ms 1748 KB Output is correct
18 Correct 3 ms 1748 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 980 KB Output is correct
30 Correct 3 ms 980 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 2 ms 336 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 195 ms 6640 KB Output is correct
18 Correct 185 ms 6540 KB Output is correct
19 Correct 151 ms 6124 KB Output is correct
20 Correct 130 ms 6188 KB Output is correct
21 Correct 128 ms 6216 KB Output is correct
22 Correct 130 ms 6192 KB Output is correct
23 Correct 128 ms 6244 KB Output is correct
24 Correct 129 ms 6224 KB Output is correct
25 Correct 165 ms 6164 KB Output is correct
26 Correct 131 ms 6220 KB Output is correct
27 Correct 131 ms 6112 KB Output is correct
28 Correct 129 ms 6128 KB Output is correct
29 Correct 125 ms 6188 KB Output is correct
30 Correct 241 ms 6548 KB Output is correct
31 Correct 185 ms 6604 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 4 ms 1748 KB Output is correct
18 Correct 3 ms 1748 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 980 KB Output is correct
30 Correct 3 ms 980 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 2 ms 336 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 2 ms 340 KB Output is correct
47 Correct 195 ms 6640 KB Output is correct
48 Correct 185 ms 6540 KB Output is correct
49 Correct 151 ms 6124 KB Output is correct
50 Correct 130 ms 6188 KB Output is correct
51 Correct 128 ms 6216 KB Output is correct
52 Correct 130 ms 6192 KB Output is correct
53 Correct 128 ms 6244 KB Output is correct
54 Correct 129 ms 6224 KB Output is correct
55 Correct 165 ms 6164 KB Output is correct
56 Correct 131 ms 6220 KB Output is correct
57 Correct 131 ms 6112 KB Output is correct
58 Correct 129 ms 6128 KB Output is correct
59 Correct 125 ms 6188 KB Output is correct
60 Correct 241 ms 6548 KB Output is correct
61 Correct 185 ms 6604 KB Output is correct
62 Correct 220 ms 10160 KB Output is correct
63 Correct 420 ms 153324 KB Output is correct
64 Correct 376 ms 153352 KB Output is correct
65 Correct 168 ms 9424 KB Output is correct
66 Correct 177 ms 9320 KB Output is correct
67 Correct 168 ms 9696 KB Output is correct
68 Correct 167 ms 9728 KB Output is correct
69 Correct 168 ms 9616 KB Output is correct
70 Correct 150 ms 9572 KB Output is correct
71 Correct 150 ms 9556 KB Output is correct
72 Correct 157 ms 8624 KB Output is correct
73 Correct 283 ms 81024 KB Output is correct
74 Correct 419 ms 81360 KB Output is correct
75 Correct 385 ms 153036 KB Output is correct
76 Correct 391 ms 153360 KB Output is correct
77 Correct 390 ms 153592 KB Output is correct
78 Correct 391 ms 152624 KB Output is correct