oj.uz

Submission #792029

# Submission time Handle Problem Language Result Execution time Memory
792029 2023-07-24T14:01:58 Z WLZ Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 159 ms 16700 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "templates/debug.h"
#else
#define debug(...) 0
#endif

#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define eb emplace_back
#define pb push_back
#define mt make_tuple
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define SZ(x) (int) x.size()

using ll = long long;
using ull = unsigned ll;
using lll = __int128_t;
using ulll = __uint128_t;
using ld = long double;
using ii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vii = vector<ii>;
template <class T> using mx_pq = priority_queue<T>;
template <class T> using mn_pq = priority_queue<T, vector<T>, greater<T>>;

const int INF = 0x3f3f3f3f;
const ll LINF = (ll) 1e18;
const double DINF = 1.0 / 0.0;
const double pi = acos(-1);
const double EPS = 1e-9;

void solve(int current_case);

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t = 1;
  //cin >> t;
  for (int q = 1; q <= t; q++) solve(q);
  return 0;
}

void solve(int current_case) {
  int n;
  cin >> n;
  vi a(n + 1);
  rep(i, 0, n) cin >> a[i];
  map<int, int> last;
  vii st;
  rep(i, 0, n) {
    int prev = last.count(a[i]) ? last[a[i]] : INF;
    last[a[i]] = i;
    while (!st.empty() && prev < st.back().first) {
      last[a[st.back().first]] = st.back().second;
      st.pop_back();
    }
    st.eb(i, prev);
  }
  vi ans(n);
  rep(i, 0, SZ(st) - 1) rep(j, st[i].first, st[i + 1].first) ans[j] = a[st[i].first];
  ans[n - 1] = a[n - 1];
  for (auto &x : ans) cout << x << '\n';
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 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 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 480 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 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 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 320 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 316 KB Output is correct
17 Correct 20 ms 4172 KB Output is correct
18 Correct 20 ms 4240 KB Output is correct
19 Correct 23 ms 3496 KB Output is correct
20 Correct 23 ms 3460 KB Output is correct
21 Correct 23 ms 3580 KB Output is correct
22 Correct 28 ms 3528 KB Output is correct
23 Correct 22 ms 3508 KB Output is correct
24 Correct 22 ms 3544 KB Output is correct
25 Correct 22 ms 3520 KB Output is correct
26 Correct 23 ms 3540 KB Output is correct
27 Correct 24 ms 3548 KB Output is correct
28 Correct 23 ms 3528 KB Output is correct
29 Correct 20 ms 3552 KB Output is correct
30 Correct 21 ms 4164 KB Output is correct
31 Correct 20 ms 4132 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 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 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 480 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 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 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 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 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 320 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 320 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 316 KB Output is correct
47 Correct 20 ms 4172 KB Output is correct
48 Correct 20 ms 4240 KB Output is correct
49 Correct 23 ms 3496 KB Output is correct
50 Correct 23 ms 3460 KB Output is correct
51 Correct 23 ms 3580 KB Output is correct
52 Correct 28 ms 3528 KB Output is correct
53 Correct 22 ms 3508 KB Output is correct
54 Correct 22 ms 3544 KB Output is correct
55 Correct 22 ms 3520 KB Output is correct
56 Correct 23 ms 3540 KB Output is correct
57 Correct 24 ms 3548 KB Output is correct
58 Correct 23 ms 3528 KB Output is correct
59 Correct 20 ms 3552 KB Output is correct
60 Correct 21 ms 4164 KB Output is correct
61 Correct 20 ms 4132 KB Output is correct
62 Correct 29 ms 7360 KB Output is correct
63 Correct 134 ms 15716 KB Output is correct
64 Correct 132 ms 15624 KB Output is correct
65 Correct 36 ms 6448 KB Output is correct
66 Correct 30 ms 6352 KB Output is correct
67 Correct 32 ms 6728 KB Output is correct
68 Correct 33 ms 6776 KB Output is correct
69 Correct 35 ms 6452 KB Output is correct
70 Correct 40 ms 6532 KB Output is correct
71 Correct 32 ms 6448 KB Output is correct
72 Correct 33 ms 5432 KB Output is correct
73 Correct 111 ms 10928 KB Output is correct
74 Correct 109 ms 11304 KB Output is correct
75 Correct 104 ms 16424 KB Output is correct
76 Correct 159 ms 16700 KB Output is correct
77 Correct 104 ms 16700 KB Output is correct
78 Correct 103 ms 16004 KB Output is correct