oj.uz

Submission #936697

# Submission time Handle Problem Language Result Execution time Memory
936697 2024-03-02T14:33:32 Z kitlix Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 158 ms 22772 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

struct SegTree {
    int h = 0;
    vector<int> flag;
    vector<int> resarr;

    SegTree(int n) {
        while ((1 << h) < n)
            h += 1;
        flag.resize((1 << (h + 1)), -1);
        resarr.resize(n);
    }

    void upd(int v, int vl, int vr, int l, int r, int val) {
        if (vl >= r || vr <= l)
            return;
        if (l <= vl && vr <= r) {
            flag[v] = val;
            return;
        }
        int vm = (vl + vr) / 2;
        upd(2 * v, vl, vm, l, r, val);
        upd(2 * v + 1, vm, vr, l, r, val);
    }

    void upd(int l, int r, int val) {
        upd(1, 0, (1 << h), l, r, val);
    }

    void calc(int v, int vl, int vr, int upval = -1) {
        if (flag[v] != -1 && upval == -1)
            upval = flag[v];
        if (vl + 1 == vr) {
            if (upval != -1)
                resarr[v - (1 << h)] = upval;
            return;
        }
        int vm = (vl + vr) / 2;
        calc(2 * v, vl, vm, upval);
        calc(2 * v + 1, vm, vr, upval);
    }

    void calc() {
        calc(1, 0, (1 << h));
    }
};

signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int n;
    cin >> n;
    vector<int> a(n);
    vector<int> curst;
    multiset<int> has;
    SegTree st(n);
    for (int i = 0; i < n; ++i) {
        int ai;
        cin >> ai;
        a[i] = ai;
        if (!has.count(ai)) {
            has.insert(ai);
            curst.push_back(i);
            st.upd(i, i + 1, ai);
            continue;
        }
        while (a[curst.back()] != ai) {
            has.extract(a[curst.back()]);
            curst.pop_back();
        }
        st.upd(curst.back(), i + 1, ai);
    }
    st.calc();
    for (auto el : st.resarr)
        cout << el << '\n';
}

Subtask #1
25.0 / 25.0

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

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 456 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 35 ms 8328 KB Output is correct
18 Correct 36 ms 8272 KB Output is correct
19 Correct 47 ms 8612 KB Output is correct
20 Correct 42 ms 8276 KB Output is correct
21 Correct 46 ms 8432 KB Output is correct
22 Correct 43 ms 8456 KB Output is correct
23 Correct 43 ms 8344 KB Output is correct
24 Correct 42 ms 8276 KB Output is correct
25 Correct 43 ms 8272 KB Output is correct
26 Correct 42 ms 8308 KB Output is correct
27 Correct 42 ms 8272 KB Output is correct
28 Correct 42 ms 8348 KB Output is correct
29 Correct 44 ms 8276 KB Output is correct
30 Correct 45 ms 8276 KB Output is correct
31 Correct 35 ms 8276 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 548 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 456 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 35 ms 8328 KB Output is correct
48 Correct 36 ms 8272 KB Output is correct
49 Correct 47 ms 8612 KB Output is correct
50 Correct 42 ms 8276 KB Output is correct
51 Correct 46 ms 8432 KB Output is correct
52 Correct 43 ms 8456 KB Output is correct
53 Correct 43 ms 8344 KB Output is correct
54 Correct 42 ms 8276 KB Output is correct
55 Correct 43 ms 8272 KB Output is correct
56 Correct 42 ms 8308 KB Output is correct
57 Correct 42 ms 8272 KB Output is correct
58 Correct 42 ms 8348 KB Output is correct
59 Correct 44 ms 8276 KB Output is correct
60 Correct 45 ms 8276 KB Output is correct
61 Correct 35 ms 8276 KB Output is correct
62 Correct 44 ms 11696 KB Output is correct
63 Correct 118 ms 15812 KB Output is correct
64 Correct 119 ms 14660 KB Output is correct
65 Correct 53 ms 11348 KB Output is correct
66 Correct 54 ms 11140 KB Output is correct
67 Correct 61 ms 11744 KB Output is correct
68 Correct 52 ms 11604 KB Output is correct
69 Correct 55 ms 11656 KB Output is correct
70 Correct 55 ms 11600 KB Output is correct
71 Correct 54 ms 11604 KB Output is correct
72 Correct 55 ms 11380 KB Output is correct
73 Correct 118 ms 16768 KB Output is correct
74 Correct 108 ms 16944 KB Output is correct
75 Correct 140 ms 22488 KB Output is correct
76 Correct 158 ms 22368 KB Output is correct
77 Correct 119 ms 22464 KB Output is correct
78 Correct 137 ms 22772 KB Output is correct