oj.uz

Submission #950767

# Submission time Handle Problem Language Result Execution time Memory
950767 2024-03-20T16:23:06 Z peterandvoi Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 115 ms 18376 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef ngu
#include "debug.h"
#else
#define debug(...) 42
#endif

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    #ifdef ngu
    freopen("test.inp", "r", stdin);
    freopen("test.out", "w", stdout);
    #endif
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    auto v = a;
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    vector<vector<int>> pos((int) v.size());
    vector<int> st;
    for (int i = 0; i < n; ++i) {
        a[i] = lower_bound(v.begin(), v.end(), a[i]) - v.begin();
        if (pos[a[i]].size()) {
            int L = pos[a[i]].back();
            while (st.size() && st.back() > L) {
                pos[a[st.back()]].pop_back();
                st.pop_back();
            }
        }
        pos[a[i]].emplace_back(i);
        st.emplace_back(i);
    }
    vector<int> res(n, -1);
    for (int i = 0; i < (int) v.size(); ++i) {
        for (int j : pos[i]) {
            res[j] = v[i];
        }
    }
    for (int i = n - 1; ~i; --i) {
        res[i] = res[i] == -1 ? res[i + 1] : res[i];
    }
    for (int i = 0; i < n; ++i) {
        cout << res[i] << "\n";
    }
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 348 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 464 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 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 600 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 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 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 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct

Subtask #2
35.0 / 35.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 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 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 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 22 ms 5188 KB Output is correct
18 Correct 27 ms 5320 KB Output is correct
19 Correct 32 ms 4308 KB Output is correct
20 Correct 24 ms 4544 KB Output is correct
21 Correct 25 ms 4364 KB Output is correct
22 Correct 24 ms 4548 KB Output is correct
23 Correct 24 ms 4548 KB Output is correct
24 Correct 25 ms 4548 KB Output is correct
25 Correct 25 ms 4552 KB Output is correct
26 Correct 24 ms 4340 KB Output is correct
27 Correct 25 ms 4412 KB Output is correct
28 Correct 24 ms 4484 KB Output is correct
29 Correct 22 ms 4552 KB Output is correct
30 Correct 25 ms 5228 KB Output is correct
31 Correct 30 ms 5320 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 348 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 464 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 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 600 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 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 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 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 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 1 ms 344 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 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 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 22 ms 5188 KB Output is correct
48 Correct 27 ms 5320 KB Output is correct
49 Correct 32 ms 4308 KB Output is correct
50 Correct 24 ms 4544 KB Output is correct
51 Correct 25 ms 4364 KB Output is correct
52 Correct 24 ms 4548 KB Output is correct
53 Correct 24 ms 4548 KB Output is correct
54 Correct 25 ms 4548 KB Output is correct
55 Correct 25 ms 4552 KB Output is correct
56 Correct 24 ms 4340 KB Output is correct
57 Correct 25 ms 4412 KB Output is correct
58 Correct 24 ms 4484 KB Output is correct
59 Correct 22 ms 4552 KB Output is correct
60 Correct 25 ms 5228 KB Output is correct
61 Correct 30 ms 5320 KB Output is correct
62 Correct 33 ms 8384 KB Output is correct
63 Correct 84 ms 17860 KB Output is correct
64 Correct 89 ms 18032 KB Output is correct
65 Correct 35 ms 7364 KB Output is correct
66 Correct 43 ms 7368 KB Output is correct
67 Correct 34 ms 7688 KB Output is correct
68 Correct 35 ms 7732 KB Output is correct
69 Correct 36 ms 7296 KB Output is correct
70 Correct 35 ms 7216 KB Output is correct
71 Correct 35 ms 7368 KB Output is correct
72 Correct 35 ms 7316 KB Output is correct
73 Correct 68 ms 12488 KB Output is correct
74 Correct 73 ms 12536 KB Output is correct
75 Correct 91 ms 18280 KB Output is correct
76 Correct 81 ms 18316 KB Output is correct
77 Correct 90 ms 18376 KB Output is correct
78 Correct 115 ms 18372 KB Output is correct