oj.uz

Submission #978192

# Submission time Handle Problem Language Result Execution time Memory
978192 2024-05-09T02:40:19 Z asdfgrace Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 58 ms 16200 KB 
#include <bits/stdc++.h>
using namespace std;

#define dbg(x) x
#define prt(x) dbg(cerr << x)
#define pv(x) dbg(cerr << #x << " = " << x << '\n')
#define pv2(x) dbg(cerr << #x << " = " << x.first << ',' << x.second << '\n')
#define parr(x) dbg(prt(#x << " = { "); for (auto y : x) prt(y << ' '); prt("}\n");)
#define parr2(x) dbg(prt(#x << " = { "); for (auto [y, z] : x) prt(y << ',' << z << "  "); prt("}\n");)
#define parr2d(x) dbg(prt(#x << ":\n"); for (auto arr : x) {parr(arr);} prt('\n'));
#define parr2d2(x) dbg(prt(#x << ":\n"); for (auto arr : x) {parr2(arr);} prt('\n'));

/*
if said elem has a previous occurrence
delete ranges from the array and decrease the counts
until you get to the previous occurrence
and extend the right bound from there to i
else
you just add a range of length 1 ending at i and increase the cnt by 1
*/

int main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<int> ord(n);
  iota(ord.begin(), ord.end(), 0);
  sort(ord.begin(), ord.end(), [&] (int x, int y) {
    return a[x] < a[y];
  });
  vector<int> b(n), val(1, a[ord[0]]);
  vector<vector<int>> at(n);
  int cur = 0;
  for (int i = 0; i < n; i++) {
    if (i > 0 && a[ord[i]] > a[ord[i - 1]]) {
      cur++;
      val.push_back(a[ord[i]]);
    }
    b[ord[i]] = cur;
  }
  vector<int> cnt(n, 0);
  vector<array<int, 3>> r;
  for (int i = 0; i < n; i++) {
    if (cnt[b[i]]) {
      while (r.size() && r[r.size() - 1][0] != b[i]) {
        cnt[r[r.size() - 1][0]]--;
        r.pop_back();
      }
      assert(r.size() && r[r.size() - 1][0] == b[i]);
      r[r.size() - 1][2] = i;
    } else {
      cnt[b[i]]++;
      r.push_back({b[i], i, i});
    }
  }
  for (auto [k, lb, rb] : r) {
    for (int i = lb; i <= rb; i++) {
      cout << val[k] << '\n';
    }
  }
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 344 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 456 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 344 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 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 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 456 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 604 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 0 ms 348 KB Output is correct
17 Correct 23 ms 8988 KB Output is correct
18 Correct 23 ms 9048 KB Output is correct
19 Correct 25 ms 9048 KB Output is correct
20 Correct 28 ms 9052 KB Output is correct
21 Correct 25 ms 9052 KB Output is correct
22 Correct 26 ms 9084 KB Output is correct
23 Correct 25 ms 9048 KB Output is correct
24 Correct 25 ms 9052 KB Output is correct
25 Correct 25 ms 9040 KB Output is correct
26 Correct 26 ms 9040 KB Output is correct
27 Correct 25 ms 9056 KB Output is correct
28 Correct 25 ms 9044 KB Output is correct
29 Correct 24 ms 9052 KB Output is correct
30 Correct 23 ms 9048 KB Output is correct
31 Correct 24 ms 9296 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 344 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 456 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 344 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 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 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 456 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 456 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 604 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 0 ms 348 KB Output is correct
47 Correct 23 ms 8988 KB Output is correct
48 Correct 23 ms 9048 KB Output is correct
49 Correct 25 ms 9048 KB Output is correct
50 Correct 28 ms 9052 KB Output is correct
51 Correct 25 ms 9052 KB Output is correct
52 Correct 26 ms 9084 KB Output is correct
53 Correct 25 ms 9048 KB Output is correct
54 Correct 25 ms 9052 KB Output is correct
55 Correct 25 ms 9040 KB Output is correct
56 Correct 26 ms 9040 KB Output is correct
57 Correct 25 ms 9056 KB Output is correct
58 Correct 25 ms 9044 KB Output is correct
59 Correct 24 ms 9052 KB Output is correct
60 Correct 23 ms 9048 KB Output is correct
61 Correct 24 ms 9296 KB Output is correct
62 Correct 32 ms 12116 KB Output is correct
63 Correct 55 ms 14660 KB Output is correct
64 Correct 54 ms 14320 KB Output is correct
65 Correct 38 ms 11812 KB Output is correct
66 Correct 35 ms 11600 KB Output is correct
67 Correct 35 ms 12168 KB Output is correct
68 Correct 35 ms 12124 KB Output is correct
69 Correct 36 ms 12112 KB Output is correct
70 Correct 36 ms 12108 KB Output is correct
71 Correct 36 ms 12056 KB Output is correct
72 Correct 43 ms 12112 KB Output is correct
73 Correct 49 ms 14020 KB Output is correct
74 Correct 50 ms 14152 KB Output is correct
75 Correct 52 ms 16076 KB Output is correct
76 Correct 51 ms 16088 KB Output is correct
77 Correct 55 ms 16200 KB Output is correct
78 Correct 58 ms 16160 KB Output is correct