oj.uz

Submission #820027

# Submission time Handle Problem Language Result Execution time Memory
820027 2023-08-10T18:03:45 Z makrav Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 207 ms 26944 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<int> vei;
typedef vector<vei> vevei;

#define coa               \
            for (auto i : a) {    \
                cout << i << ' '; \
            }                     \
            cout << '\n';
#define cia             \
            for (auto& i : a) { \
                cin >> a;       \
            }
#define cna                       \
            int n;                        \
            cin >> n;                     \
            vector<int> a(n);             \
            for (int i = 0; i < n; i++) { \
                cin >> a[i];              \
            }
#define cnka                      \
            int n, k;                     \
            cin >> n >> k;                \
            vector<int> a(n);             \
            for (int i = 0; i < n; i++) { \
                cin >> a[i];              \
            }
#define cnab                      \
            int n;                        \
            cin >> n;                     \
            vector<int> a(n);             \
            for (int i = 0; i < n; i++) { \
                cin >> a[i];              \
            }                             \
            vector<int> b(n);             \
            for (int i = 0; i < n; i++) { \
                cin >> b[i];              \
            }
#define all(a) (a).begin(), (a).end()
#define sz(a) (int) a.size()
#define con cout << "NO\n"
#define coe cout << "YES\n";
#define str string
#define pb push_back
#define ff first
#define sc second
#define pii pair<int, int>
#define mxe max_element
#define mne min_element
#define stf shrink_to_fit
#define f(i, l, r) for (int i = (l); i < (r); i++)
#define double ld

void solve() {
    int n; cin >> n;
    vector<int> a(n);
    for (auto& u : a) cin >> u;
    map<int, vector<int>> pos;
    f(i, 0, n) pos[a[i]].pb(i);
    int ind = 0;
    while (true) {
        if (ind == n) break;
        int bc = pos[a[ind]].back();
        for (int j = 0; j < bc - ind + 1; j++) cout << a[ind] << '\n';
        ind = bc + 1;
    }
}

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

    int tt = 1; // cin >> tt;
    while (tt--) {
        solve();
    }

    return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 468 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 18 ms 2720 KB Output is correct
18 Correct 18 ms 2768 KB Output is correct
19 Correct 19 ms 2852 KB Output is correct
20 Correct 19 ms 2692 KB Output is correct
21 Correct 19 ms 2772 KB Output is correct
22 Correct 22 ms 2880 KB Output is correct
23 Correct 19 ms 2720 KB Output is correct
24 Correct 19 ms 2764 KB Output is correct
25 Correct 19 ms 2844 KB Output is correct
26 Correct 19 ms 2848 KB Output is correct
27 Correct 19 ms 2888 KB Output is correct
28 Correct 19 ms 2748 KB Output is correct
29 Correct 18 ms 2916 KB Output is correct
30 Correct 19 ms 2732 KB Output is correct
31 Correct 18 ms 2768 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 0 ms 320 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 324 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 320 KB Output is correct
43 Correct 1 ms 324 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 320 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 18 ms 2720 KB Output is correct
48 Correct 18 ms 2768 KB Output is correct
49 Correct 19 ms 2852 KB Output is correct
50 Correct 19 ms 2692 KB Output is correct
51 Correct 19 ms 2772 KB Output is correct
52 Correct 22 ms 2880 KB Output is correct
53 Correct 19 ms 2720 KB Output is correct
54 Correct 19 ms 2764 KB Output is correct
55 Correct 19 ms 2844 KB Output is correct
56 Correct 19 ms 2848 KB Output is correct
57 Correct 19 ms 2888 KB Output is correct
58 Correct 19 ms 2748 KB Output is correct
59 Correct 18 ms 2916 KB Output is correct
60 Correct 19 ms 2732 KB Output is correct
61 Correct 18 ms 2768 KB Output is correct
62 Correct 28 ms 5952 KB Output is correct
63 Correct 147 ms 26920 KB Output is correct
64 Correct 156 ms 26936 KB Output is correct
65 Correct 31 ms 5572 KB Output is correct
66 Correct 28 ms 5564 KB Output is correct
67 Correct 38 ms 5952 KB Output is correct
68 Correct 30 ms 5892 KB Output is correct
69 Correct 29 ms 5980 KB Output is correct
70 Correct 34 ms 5936 KB Output is correct
71 Correct 29 ms 5932 KB Output is correct
72 Correct 30 ms 5008 KB Output is correct
73 Correct 112 ms 15672 KB Output is correct
74 Correct 95 ms 15908 KB Output is correct
75 Correct 207 ms 26476 KB Output is correct
76 Correct 126 ms 26944 KB Output is correct
77 Correct 197 ms 26828 KB Output is correct
78 Correct 202 ms 26208 KB Output is correct