oj.uz

Submission #931502

# Submission time Handle Problem Language Result Execution time Memory
931502 2024-02-22T01:02:46 Z Pring Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 199 ms 34036 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef MIKU
#define debug(x...) cout << "[" << #x << "] : ", dout(x)
void dout() { cout << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define debug(...) 39
#endif

#define int long long
#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
typedef pair<int, int> pii;

const int MXN = 200005;
int n, a[MXN];
pii dist[MXN];
vector<int> st[MXN], ST;
map<int, int> M;

void DIST() {
    FOR(i, 0, n) dist[i] = mp(a[i], i);
    sort(dist, dist + n);
    for (int i = 0, j = 0; i < n; i = j) {
        while (j < n && dist[i].fs == dist[j].fs) j++;
        M[i] = dist[i].fs;
        FOR(k, i, j) dist[k].fs = i;
    }
    FOR(i, 0, n) a[dist[i].sc] = dist[i].fs;
}

void miku() {
    cin >> n;
    FOR(i, 0, n) cin >> a[i];
    DIST();
    FOR(i, 0, n) {
        if (st[a[i]].size()) {
            int lst = st[a[i]].back();
            while (ST.back() != lst) {
                st[a[ST.back()]].pop_back();
                ST.pop_back();
            }
        }
        st[a[i]].push_back(i);
        ST.push_back(i);
    }
    int now = -1, id = 0;
    FOR(i, 0, n) {
        if (ST[id] == i) {
            id++;
            now = a[i];
        }
        cout << M[now] << '\n';
    }
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(false);
    cin.exceptions(iostream::failbit);
    miku();
    return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 2 ms 8824 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 8836 KB Output is correct
11 Correct 3 ms 8864 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 8796 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Correct 3 ms 8880 KB Output is correct
16 Correct 2 ms 8796 KB Output is correct
17 Correct 2 ms 9052 KB Output is correct
18 Correct 2 ms 8852 KB Output is correct
19 Correct 2 ms 8792 KB Output is correct
20 Correct 2 ms 8796 KB Output is correct
21 Correct 2 ms 8796 KB Output is correct
22 Correct 2 ms 8796 KB Output is correct
23 Correct 2 ms 8792 KB Output is correct
24 Correct 2 ms 8796 KB Output is correct
25 Correct 2 ms 8796 KB Output is correct
26 Correct 3 ms 8796 KB Output is correct
27 Correct 2 ms 8796 KB Output is correct
28 Correct 3 ms 8792 KB Output is correct
29 Correct 2 ms 8796 KB Output is correct
30 Correct 2 ms 8796 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 3 ms 8796 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 5 ms 8792 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 8796 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8844 KB Output is correct
13 Correct 2 ms 8796 KB Output is correct
14 Correct 2 ms 8800 KB Output is correct
15 Correct 2 ms 8796 KB Output is correct
16 Correct 2 ms 8796 KB Output is correct
17 Correct 28 ms 13944 KB Output is correct
18 Correct 28 ms 13748 KB Output is correct
19 Correct 40 ms 12236 KB Output is correct
20 Correct 39 ms 12144 KB Output is correct
21 Correct 37 ms 12260 KB Output is correct
22 Correct 38 ms 12224 KB Output is correct
23 Correct 39 ms 12292 KB Output is correct
24 Correct 37 ms 12236 KB Output is correct
25 Correct 41 ms 12324 KB Output is correct
26 Correct 36 ms 12232 KB Output is correct
27 Correct 38 ms 12304 KB Output is correct
28 Correct 37 ms 12420 KB Output is correct
29 Correct 31 ms 12232 KB Output is correct
30 Correct 27 ms 13908 KB Output is correct
31 Correct 27 ms 13760 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 2 ms 8824 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 8836 KB Output is correct
11 Correct 3 ms 8864 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 8796 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Correct 3 ms 8880 KB Output is correct
16 Correct 2 ms 8796 KB Output is correct
17 Correct 2 ms 9052 KB Output is correct
18 Correct 2 ms 8852 KB Output is correct
19 Correct 2 ms 8792 KB Output is correct
20 Correct 2 ms 8796 KB Output is correct
21 Correct 2 ms 8796 KB Output is correct
22 Correct 2 ms 8796 KB Output is correct
23 Correct 2 ms 8792 KB Output is correct
24 Correct 2 ms 8796 KB Output is correct
25 Correct 2 ms 8796 KB Output is correct
26 Correct 3 ms 8796 KB Output is correct
27 Correct 2 ms 8796 KB Output is correct
28 Correct 3 ms 8792 KB Output is correct
29 Correct 2 ms 8796 KB Output is correct
30 Correct 2 ms 8796 KB Output is correct
31 Correct 2 ms 8796 KB Output is correct
32 Correct 2 ms 8796 KB Output is correct
33 Correct 2 ms 8796 KB Output is correct
34 Correct 3 ms 8796 KB Output is correct
35 Correct 2 ms 8796 KB Output is correct
36 Correct 5 ms 8792 KB Output is correct
37 Correct 2 ms 8796 KB Output is correct
38 Correct 2 ms 8796 KB Output is correct
39 Correct 2 ms 8796 KB Output is correct
40 Correct 2 ms 8796 KB Output is correct
41 Correct 2 ms 8796 KB Output is correct
42 Correct 2 ms 8844 KB Output is correct
43 Correct 2 ms 8796 KB Output is correct
44 Correct 2 ms 8800 KB Output is correct
45 Correct 2 ms 8796 KB Output is correct
46 Correct 2 ms 8796 KB Output is correct
47 Correct 28 ms 13944 KB Output is correct
48 Correct 28 ms 13748 KB Output is correct
49 Correct 40 ms 12236 KB Output is correct
50 Correct 39 ms 12144 KB Output is correct
51 Correct 37 ms 12260 KB Output is correct
52 Correct 38 ms 12224 KB Output is correct
53 Correct 39 ms 12292 KB Output is correct
54 Correct 37 ms 12236 KB Output is correct
55 Correct 41 ms 12324 KB Output is correct
56 Correct 36 ms 12232 KB Output is correct
57 Correct 38 ms 12304 KB Output is correct
58 Correct 37 ms 12420 KB Output is correct
59 Correct 31 ms 12232 KB Output is correct
60 Correct 27 ms 13908 KB Output is correct
61 Correct 27 ms 13760 KB Output is correct
62 Correct 37 ms 17012 KB Output is correct
63 Correct 114 ms 32968 KB Output is correct
64 Correct 133 ms 33084 KB Output is correct
65 Correct 46 ms 15296 KB Output is correct
66 Correct 51 ms 15112 KB Output is correct
67 Correct 45 ms 15392 KB Output is correct
68 Correct 50 ms 15632 KB Output is correct
69 Correct 48 ms 14956 KB Output is correct
70 Correct 49 ms 15040 KB Output is correct
71 Correct 50 ms 15036 KB Output is correct
72 Correct 56 ms 15044 KB Output is correct
73 Correct 101 ms 23748 KB Output is correct
74 Correct 82 ms 23748 KB Output is correct
75 Correct 199 ms 33984 KB Output is correct
76 Correct 105 ms 34036 KB Output is correct
77 Correct 170 ms 33960 KB Output is correct
78 Correct 165 ms 33888 KB Output is correct