oj.uz

Submission #922993

# Submission time Handle Problem Language Result Execution time Memory
922993 2024-02-06T12:09:24 Z Gromp15 Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 213 ms 31200 KB 
#include <bits/stdc++.h>
#define ll long long
#define ar array
#define db double
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define rint(l, r) uniform_int_distribution<int>(l, r)(rng)
template<typename T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
struct segtree {
    int N; vector<int> tree, time;
    segtree(int n) : N(1<<(__lg(n)+1)), tree(2*N, -1), time(2*N, -1) {}
    void update(int node, int nl, int nr, int ql, int qr, int v, int cur_time) {
        if (ql > nr || qr < nl) return;
        if (ql <= nl && nr <= qr) {
            tree[node] = v;
            time[node] = cur_time;
            return;
        }
        int mid = (nl+nr)/2;
        update(node*2, nl, mid, ql, qr, v, cur_time);
        update(node*2+1, mid+1, nr, ql, qr, v, cur_time);
    }
    int query(int pos) {
        int mx_time = -1, col = -1;
        for (int i = pos+N; i; i >>= 1) {
            if (ckmax(mx_time, time[i])) {
                col = tree[i];
            }
        }
        return col;
    }
};
void test_case() {
    int n; cin >> n;
    vector<int> a(n);
    for (int &x : a) cin >> x;
    map<int, vector<int>> cols;
    segtree st(n);
    for (int i = 0; i < n; i++) {
        while (cols[a[i]].size()) {
            int c = cols[a[i]].back();
            int ret = st.query(c);
            if (~ret && ret != a[i]) cols[a[i]].pop_back();
            else break;
        }
        if (cols[a[i]].size()) {
            int c = cols[a[i]].back();
            st.update(1, 0, st.N-1, c, i, a[i], i);
        }
        cols[a[i]].push_back(i);
    }
    for (int i = 0; i < n; i++) cout << (~st.query(i) ? st.query(i) : a[i]) << '\n';
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
//    cin >> t;
    while (t--) test_case();
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
5 Correct 0 ms 600 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 464 KB Output is correct
9 Correct 0 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 348 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 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 476 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 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 344 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 1 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 456 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 456 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 56 ms 6828 KB Output is correct
18 Correct 46 ms 6976 KB Output is correct
19 Correct 50 ms 6604 KB Output is correct
20 Correct 50 ms 6664 KB Output is correct
21 Correct 48 ms 6640 KB Output is correct
22 Correct 48 ms 6608 KB Output is correct
23 Correct 49 ms 6516 KB Output is correct
24 Correct 49 ms 6608 KB Output is correct
25 Correct 47 ms 6628 KB Output is correct
26 Correct 49 ms 6676 KB Output is correct
27 Correct 48 ms 6612 KB Output is correct
28 Correct 59 ms 6672 KB Output is correct
29 Correct 37 ms 6564 KB Output is correct
30 Correct 46 ms 6864 KB Output is correct
31 Correct 46 ms 7008 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 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 600 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 464 KB Output is correct
9 Correct 0 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 348 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 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 476 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 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 344 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 456 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 460 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 456 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 460 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 56 ms 6828 KB Output is correct
48 Correct 46 ms 6976 KB Output is correct
49 Correct 50 ms 6604 KB Output is correct
50 Correct 50 ms 6664 KB Output is correct
51 Correct 48 ms 6640 KB Output is correct
52 Correct 48 ms 6608 KB Output is correct
53 Correct 49 ms 6516 KB Output is correct
54 Correct 49 ms 6608 KB Output is correct
55 Correct 47 ms 6628 KB Output is correct
56 Correct 49 ms 6676 KB Output is correct
57 Correct 48 ms 6612 KB Output is correct
58 Correct 59 ms 6672 KB Output is correct
59 Correct 37 ms 6564 KB Output is correct
60 Correct 46 ms 6864 KB Output is correct
61 Correct 46 ms 7008 KB Output is correct
62 Correct 57 ms 10192 KB Output is correct
63 Correct 213 ms 31200 KB Output is correct
64 Correct 160 ms 31168 KB Output is correct
65 Correct 59 ms 9424 KB Output is correct
66 Correct 57 ms 9336 KB Output is correct
67 Correct 58 ms 9688 KB Output is correct
68 Correct 59 ms 9800 KB Output is correct
69 Correct 60 ms 9684 KB Output is correct
70 Correct 58 ms 9560 KB Output is correct
71 Correct 59 ms 9552 KB Output is correct
72 Correct 60 ms 9580 KB Output is correct
73 Correct 146 ms 20048 KB Output is correct
74 Correct 173 ms 20052 KB Output is correct
75 Correct 181 ms 31156 KB Output is correct
76 Correct 183 ms 31104 KB Output is correct
77 Correct 195 ms 31056 KB Output is correct
78 Correct 164 ms 31164 KB Output is correct