oj.uz

Submission #895521

# Submission time Handle Problem Language Result Execution time Memory
895521 2023-12-30T07:27:35 Z LiuBruh Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 248 ms 43168 KB 
#include <bits/stdc++.h>

#define int long long
#define sz(v) (int)v.size()
using namespace std;

const int maxn = (int)2e5 + 5;
const int INF = (int)1e18 + 5;

struct Node {
    int l, r, val;
};

int n;
int ar[maxn];
set<int> st[maxn];
vector<Node> an;
map<int, int> revans;

void hehe() {
    vector<int> tmp;
    for (int i = 1; i <= n; i++) {
        tmp.push_back(ar[i]);
    }
    sort(tmp.begin(), tmp.end());
    tmp.resize(unique(tmp.begin(), tmp.end()) - tmp.begin());
    for (int i = 1; i <= n; i++) {
        int x = lower_bound(tmp.begin(), tmp.end(), ar[i]) - tmp.begin() + 1;
        revans[x] = ar[i];
        ar[i] = x;
    }
}

void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> ar[i];
    hehe();

    for (int i = 1; i <= n; i++) {
        int x = ar[i];
        if (sz(st[x]) != 0) {
            int p = *st[ar[i]].rbegin();
            st[ar[i]].erase(p);
            while (an.back().l > p) {
                auto [ql, qr, qx] = an.back();  an.pop_back();
                st[qx].erase(qr);
            }
            while (sz(an) and an.back().val == ar[i]) {
                p = an.back().l;
                st[ar[i]].erase(an.back().r);
                an.pop_back();
            }
            st[ar[i]].insert(i);
            an.push_back({p, i, ar[i]});
        } else {
            st[ar[i]].insert(i);
            an.push_back({i, i, ar[i]});
        }
    }

    for (auto [ql, qr, qx] : an) {
        // cout << "test " << ql << ' ' << qr << ' ' << revans[qx] << '\n';
        for (int i = ql; i <= qr; i++) {
            cout << revans[qx] << '\n';
        }
    }
}
/*
6
1
2
1
2
3
2

10
1
1
2
2
1
2
2
1
1
2
*/

signed main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);

    solve();

    return 0;
}

Subtask #1
25.0 / 25.0

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

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10844 KB Output is correct
2 Correct 2 ms 10848 KB Output is correct
3 Correct 2 ms 10844 KB Output is correct
4 Correct 2 ms 10844 KB Output is correct
5 Correct 2 ms 10840 KB Output is correct
6 Correct 2 ms 10844 KB Output is correct
7 Correct 2 ms 10844 KB Output is correct
8 Correct 2 ms 10844 KB Output is correct
9 Correct 2 ms 10844 KB Output is correct
10 Correct 2 ms 10844 KB Output is correct
11 Correct 3 ms 10996 KB Output is correct
12 Correct 2 ms 10844 KB Output is correct
13 Correct 2 ms 10844 KB Output is correct
14 Correct 3 ms 10844 KB Output is correct
15 Correct 2 ms 10844 KB Output is correct
16 Correct 2 ms 11096 KB Output is correct
17 Correct 32 ms 13512 KB Output is correct
18 Correct 30 ms 13528 KB Output is correct
19 Correct 35 ms 13528 KB Output is correct
20 Correct 34 ms 13528 KB Output is correct
21 Correct 35 ms 13524 KB Output is correct
22 Correct 35 ms 13528 KB Output is correct
23 Correct 33 ms 13528 KB Output is correct
24 Correct 35 ms 13528 KB Output is correct
25 Correct 35 ms 13524 KB Output is correct
26 Correct 34 ms 13524 KB Output is correct
27 Correct 34 ms 13528 KB Output is correct
28 Correct 35 ms 13524 KB Output is correct
29 Correct 30 ms 13524 KB Output is correct
30 Correct 33 ms 13528 KB Output is correct
31 Correct 31 ms 13528 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10844 KB Output is correct
2 Correct 2 ms 10844 KB Output is correct
3 Correct 2 ms 10840 KB Output is correct
4 Correct 3 ms 10840 KB Output is correct
5 Correct 2 ms 10844 KB Output is correct
6 Correct 2 ms 10844 KB Output is correct
7 Correct 2 ms 10844 KB Output is correct
8 Correct 3 ms 10844 KB Output is correct
9 Correct 2 ms 10844 KB Output is correct
10 Correct 2 ms 10844 KB Output is correct
11 Correct 2 ms 10844 KB Output is correct
12 Correct 2 ms 10844 KB Output is correct
13 Correct 2 ms 10844 KB Output is correct
14 Correct 2 ms 10844 KB Output is correct
15 Correct 2 ms 10840 KB Output is correct
16 Correct 2 ms 10844 KB Output is correct
17 Correct 3 ms 10956 KB Output is correct
18 Correct 3 ms 11104 KB Output is correct
19 Correct 2 ms 10844 KB Output is correct
20 Correct 2 ms 10844 KB Output is correct
21 Correct 2 ms 10844 KB Output is correct
22 Correct 2 ms 10844 KB Output is correct
23 Correct 2 ms 10844 KB Output is correct
24 Correct 2 ms 10844 KB Output is correct
25 Correct 2 ms 10844 KB Output is correct
26 Correct 3 ms 10840 KB Output is correct
27 Correct 2 ms 10840 KB Output is correct
28 Correct 2 ms 10844 KB Output is correct
29 Correct 3 ms 10844 KB Output is correct
30 Correct 3 ms 10844 KB Output is correct
31 Correct 2 ms 10844 KB Output is correct
32 Correct 2 ms 10848 KB Output is correct
33 Correct 2 ms 10844 KB Output is correct
34 Correct 2 ms 10844 KB Output is correct
35 Correct 2 ms 10840 KB Output is correct
36 Correct 2 ms 10844 KB Output is correct
37 Correct 2 ms 10844 KB Output is correct
38 Correct 2 ms 10844 KB Output is correct
39 Correct 2 ms 10844 KB Output is correct
40 Correct 2 ms 10844 KB Output is correct
41 Correct 3 ms 10996 KB Output is correct
42 Correct 2 ms 10844 KB Output is correct
43 Correct 2 ms 10844 KB Output is correct
44 Correct 3 ms 10844 KB Output is correct
45 Correct 2 ms 10844 KB Output is correct
46 Correct 2 ms 11096 KB Output is correct
47 Correct 32 ms 13512 KB Output is correct
48 Correct 30 ms 13528 KB Output is correct
49 Correct 35 ms 13528 KB Output is correct
50 Correct 34 ms 13528 KB Output is correct
51 Correct 35 ms 13524 KB Output is correct
52 Correct 35 ms 13528 KB Output is correct
53 Correct 33 ms 13528 KB Output is correct
54 Correct 35 ms 13528 KB Output is correct
55 Correct 35 ms 13524 KB Output is correct
56 Correct 34 ms 13524 KB Output is correct
57 Correct 34 ms 13528 KB Output is correct
58 Correct 35 ms 13524 KB Output is correct
59 Correct 30 ms 13524 KB Output is correct
60 Correct 33 ms 13528 KB Output is correct
61 Correct 31 ms 13528 KB Output is correct
62 Correct 45 ms 13528 KB Output is correct
63 Correct 197 ms 32368 KB Output is correct
64 Correct 191 ms 29852 KB Output is correct
65 Correct 44 ms 13528 KB Output is correct
66 Correct 43 ms 13528 KB Output is correct
67 Correct 43 ms 13524 KB Output is correct
68 Correct 44 ms 13528 KB Output is correct
69 Correct 46 ms 13576 KB Output is correct
70 Correct 43 ms 13576 KB Output is correct
71 Correct 48 ms 13516 KB Output is correct
72 Correct 45 ms 13528 KB Output is correct
73 Correct 153 ms 26520 KB Output is correct
74 Correct 137 ms 26648 KB Output is correct
75 Correct 241 ms 43168 KB Output is correct
76 Correct 193 ms 41984 KB Output is correct
77 Correct 245 ms 41876 KB Output is correct
78 Correct 248 ms 42892 KB Output is correct